1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(c) 2010-2014 Intel Corporation.
3 * Copyright(c) 2016 6WIND S.A.
6 #ifndef _RTE_MEMPOOL_H_
7 #define _RTE_MEMPOOL_H_
13 * A memory pool is an allocator of fixed-size object. It is
14 * identified by its name, and uses a ring to store free objects. It
15 * provides some other optional services, like a per-core object
16 * cache, and an alignment helper to ensure that objects are padded
17 * to spread them equally on all RAM channels, ranks, and so on.
19 * Objects owned by a mempool should never be added in another
20 * mempool. When an object is freed using rte_mempool_put() or
21 * equivalent, the object data is not modified; the user can save some
22 * meta-data in the object data and retrieve them when allocating a
25 * Note: the mempool implementation is not preemptible. An lcore must not be
26 * interrupted by another task that uses the same mempool (because it uses a
27 * ring which is not preemptible). Also, usual mempool functions like
28 * rte_mempool_get() or rte_mempool_put() are designed to be called from an EAL
29 * thread due to the internal per-lcore cache. Due to the lack of caching,
30 * rte_mempool_get() or rte_mempool_put() performance will suffer when called
31 * by non-EAL threads. Instead, non-EAL threads should call
32 * rte_mempool_generic_get() or rte_mempool_generic_put() with a user cache
33 * created with rte_mempool_cache_create().
41 #include <sys/queue.h>
43 #include <rte_config.h>
44 #include <rte_spinlock.h>
46 #include <rte_debug.h>
47 #include <rte_lcore.h>
48 #include <rte_memory.h>
49 #include <rte_branch_prediction.h>
51 #include <rte_memcpy.h>
52 #include <rte_common.h>
58 #define RTE_MEMPOOL_HEADER_COOKIE1 0xbadbadbadadd2e55ULL /**< Header cookie. */
59 #define RTE_MEMPOOL_HEADER_COOKIE2 0xf2eef2eedadd2e55ULL /**< Header cookie. */
60 #define RTE_MEMPOOL_TRAILER_COOKIE 0xadd2e55badbadbadULL /**< Trailer cookie.*/
62 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
64 * A structure that stores the mempool statistics (per-lcore).
66 struct rte_mempool_debug_stats {
67 uint64_t put_bulk; /**< Number of puts. */
68 uint64_t put_objs; /**< Number of objects successfully put. */
69 uint64_t get_success_bulk; /**< Successful allocation number. */
70 uint64_t get_success_objs; /**< Objects successfully allocated. */
71 uint64_t get_fail_bulk; /**< Failed allocation number. */
72 uint64_t get_fail_objs; /**< Objects that failed to be allocated. */
73 /** Successful allocation number of contiguous blocks. */
74 uint64_t get_success_blks;
75 /** Failed allocation number of contiguous blocks. */
76 uint64_t get_fail_blks;
77 } __rte_cache_aligned;
81 * A structure that stores a per-core object cache.
83 struct rte_mempool_cache {
84 uint32_t size; /**< Size of the cache */
85 uint32_t flushthresh; /**< Threshold before we flush excess elements */
86 uint32_t len; /**< Current cache count */
88 * Cache is allocated to this size to allow it to overflow in certain
89 * cases to avoid needless emptying of cache.
91 void *objs[RTE_MEMPOOL_CACHE_MAX_SIZE * 3]; /**< Cache objects */
92 } __rte_cache_aligned;
95 * A structure that stores the size of mempool elements.
97 struct rte_mempool_objsz {
98 uint32_t elt_size; /**< Size of an element. */
99 uint32_t header_size; /**< Size of header (before elt). */
100 uint32_t trailer_size; /**< Size of trailer (after elt). */
102 /**< Total size of an object (header + elt + trailer). */
105 /**< Maximum length of a memory pool's name. */
106 #define RTE_MEMPOOL_NAMESIZE (RTE_RING_NAMESIZE - \
107 sizeof(RTE_MEMPOOL_MZ_PREFIX) + 1)
108 #define RTE_MEMPOOL_MZ_PREFIX "MP_"
111 #define RTE_MEMPOOL_MZ_FORMAT RTE_MEMPOOL_MZ_PREFIX "%s"
113 #define MEMPOOL_PG_SHIFT_MAX (sizeof(uintptr_t) * CHAR_BIT - 1)
115 /** Mempool over one chunk of physically continuous memory */
116 #define MEMPOOL_PG_NUM_DEFAULT 1
118 #ifndef RTE_MEMPOOL_ALIGN
119 #define RTE_MEMPOOL_ALIGN RTE_CACHE_LINE_SIZE
122 #define RTE_MEMPOOL_ALIGN_MASK (RTE_MEMPOOL_ALIGN - 1)
125 * Mempool object header structure
127 * Each object stored in mempools are prefixed by this header structure,
128 * it allows to retrieve the mempool pointer from the object and to
129 * iterate on all objects attached to a mempool. When debug is enabled,
130 * a cookie is also added in this structure preventing corruptions and
133 struct rte_mempool_objhdr {
134 STAILQ_ENTRY(rte_mempool_objhdr) next; /**< Next in list. */
135 struct rte_mempool *mp; /**< The mempool owning the object. */
138 rte_iova_t iova; /**< IO address of the object. */
139 phys_addr_t physaddr; /**< deprecated - Physical address of the object. */
141 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
142 uint64_t cookie; /**< Debug cookie. */
147 * A list of object headers type
149 STAILQ_HEAD(rte_mempool_objhdr_list, rte_mempool_objhdr);
151 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
154 * Mempool object trailer structure
156 * In debug mode, each object stored in mempools are suffixed by this
157 * trailer structure containing a cookie preventing memory corruptions.
159 struct rte_mempool_objtlr {
160 uint64_t cookie; /**< Debug cookie. */
166 * A list of memory where objects are stored
168 STAILQ_HEAD(rte_mempool_memhdr_list, rte_mempool_memhdr);
171 * Callback used to free a memory chunk
173 typedef void (rte_mempool_memchunk_free_cb_t)(struct rte_mempool_memhdr *memhdr,
177 * Mempool objects memory header structure
179 * The memory chunks where objects are stored. Each chunk is virtually
180 * and physically contiguous.
182 struct rte_mempool_memhdr {
183 STAILQ_ENTRY(rte_mempool_memhdr) next; /**< Next in list. */
184 struct rte_mempool *mp; /**< The mempool owning the chunk */
185 void *addr; /**< Virtual address of the chunk */
188 rte_iova_t iova; /**< IO address of the chunk */
189 phys_addr_t phys_addr; /**< Physical address of the chunk */
191 size_t len; /**< length of the chunk */
192 rte_mempool_memchunk_free_cb_t *free_cb; /**< Free callback */
193 void *opaque; /**< Argument passed to the free callback */
198 * @b EXPERIMENTAL: this API may change without prior notice.
200 * Additional information about the mempool
202 * The structure is cache-line aligned to avoid ABI breakages in
203 * a number of cases when something small is added.
205 struct rte_mempool_info {
206 /** Number of objects in the contiguous block */
207 unsigned int contig_block_size;
208 } __rte_cache_aligned;
211 * The RTE mempool structure.
215 * Note: this field kept the RTE_MEMZONE_NAMESIZE size due to ABI
216 * compatibility requirements, it could be changed to
217 * RTE_MEMPOOL_NAMESIZE next time the ABI changes
219 char name[RTE_MEMZONE_NAMESIZE]; /**< Name of mempool. */
222 void *pool_data; /**< Ring or pool to store objects. */
223 uint64_t pool_id; /**< External mempool identifier. */
225 void *pool_config; /**< optional args for ops alloc. */
226 const struct rte_memzone *mz; /**< Memzone where pool is alloc'd. */
227 unsigned int flags; /**< Flags of the mempool. */
228 int socket_id; /**< Socket id passed at create. */
229 uint32_t size; /**< Max size of the mempool. */
231 /**< Size of per-lcore default local cache. */
233 uint32_t elt_size; /**< Size of an element. */
234 uint32_t header_size; /**< Size of header (before elt). */
235 uint32_t trailer_size; /**< Size of trailer (after elt). */
237 unsigned private_data_size; /**< Size of private data. */
239 * Index into rte_mempool_ops_table array of mempool ops
240 * structs, which contain callback function pointers.
241 * We're using an index here rather than pointers to the callbacks
242 * to facilitate any secondary processes that may want to use
247 struct rte_mempool_cache *local_cache; /**< Per-lcore local cache */
249 uint32_t populated_size; /**< Number of populated objects. */
250 struct rte_mempool_objhdr_list elt_list; /**< List of objects in pool */
251 uint32_t nb_mem_chunks; /**< Number of memory chunks */
252 struct rte_mempool_memhdr_list mem_list; /**< List of memory chunks */
254 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
255 /** Per-lcore statistics. */
256 struct rte_mempool_debug_stats stats[RTE_MAX_LCORE];
258 } __rte_cache_aligned;
260 #define MEMPOOL_F_NO_SPREAD 0x0001 /**< Do not spread among memory channels. */
261 #define MEMPOOL_F_NO_CACHE_ALIGN 0x0002 /**< Do not align objs on cache lines.*/
262 #define MEMPOOL_F_SP_PUT 0x0004 /**< Default put is "single-producer".*/
263 #define MEMPOOL_F_SC_GET 0x0008 /**< Default get is "single-consumer".*/
264 #define MEMPOOL_F_POOL_CREATED 0x0010 /**< Internal: pool is created. */
265 #define MEMPOOL_F_NO_IOVA_CONTIG 0x0020 /**< Don't need IOVA contiguous objs. */
266 #define MEMPOOL_F_NO_PHYS_CONTIG MEMPOOL_F_NO_IOVA_CONTIG /* deprecated */
269 * @internal When debug is enabled, store some statistics.
272 * Pointer to the memory pool.
274 * Name of the statistics field to increment in the memory pool.
276 * Number to add to the object-oriented statistics.
278 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
279 #define __MEMPOOL_STAT_ADD(mp, name, n) do { \
280 unsigned __lcore_id = rte_lcore_id(); \
281 if (__lcore_id < RTE_MAX_LCORE) { \
282 mp->stats[__lcore_id].name##_objs += n; \
283 mp->stats[__lcore_id].name##_bulk += 1; \
286 #define __MEMPOOL_CONTIG_BLOCKS_STAT_ADD(mp, name, n) do { \
287 unsigned int __lcore_id = rte_lcore_id(); \
288 if (__lcore_id < RTE_MAX_LCORE) { \
289 mp->stats[__lcore_id].name##_blks += n; \
290 mp->stats[__lcore_id].name##_bulk += 1; \
294 #define __MEMPOOL_STAT_ADD(mp, name, n) do {} while(0)
295 #define __MEMPOOL_CONTIG_BLOCKS_STAT_ADD(mp, name, n) do {} while (0)
299 * Calculate the size of the mempool header.
302 * Pointer to the memory pool.
304 * Size of the per-lcore cache.
306 #define MEMPOOL_HEADER_SIZE(mp, cs) \
307 (sizeof(*(mp)) + (((cs) == 0) ? 0 : \
308 (sizeof(struct rte_mempool_cache) * RTE_MAX_LCORE)))
310 /* return the header of a mempool object (internal) */
311 static inline struct rte_mempool_objhdr *__mempool_get_header(void *obj)
313 return (struct rte_mempool_objhdr *)RTE_PTR_SUB(obj,
314 sizeof(struct rte_mempool_objhdr));
318 * Return a pointer to the mempool owning this object.
321 * An object that is owned by a pool. If this is not the case,
322 * the behavior is undefined.
324 * A pointer to the mempool structure.
326 static inline struct rte_mempool *rte_mempool_from_obj(void *obj)
328 struct rte_mempool_objhdr *hdr = __mempool_get_header(obj);
332 /* return the trailer of a mempool object (internal) */
333 static inline struct rte_mempool_objtlr *__mempool_get_trailer(void *obj)
335 struct rte_mempool *mp = rte_mempool_from_obj(obj);
336 return (struct rte_mempool_objtlr *)RTE_PTR_ADD(obj, mp->elt_size);
340 * @internal Check and update cookies or panic.
343 * Pointer to the memory pool.
344 * @param obj_table_const
345 * Pointer to a table of void * pointers (objects).
347 * Index of object in object table.
349 * - 0: object is supposed to be allocated, mark it as free
350 * - 1: object is supposed to be free, mark it as allocated
351 * - 2: just check that cookie is valid (free or allocated)
353 void rte_mempool_check_cookies(const struct rte_mempool *mp,
354 void * const *obj_table_const, unsigned n, int free);
356 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
357 #define __mempool_check_cookies(mp, obj_table_const, n, free) \
358 rte_mempool_check_cookies(mp, obj_table_const, n, free)
360 #define __mempool_check_cookies(mp, obj_table_const, n, free) do {} while(0)
361 #endif /* RTE_LIBRTE_MEMPOOL_DEBUG */
365 * @b EXPERIMENTAL: this API may change without prior notice.
367 * @internal Check contiguous object blocks and update cookies or panic.
370 * Pointer to the memory pool.
371 * @param first_obj_table_const
372 * Pointer to a table of void * pointers (first object of the contiguous
375 * Number of contiguous object blocks.
377 * - 0: object is supposed to be allocated, mark it as free
378 * - 1: object is supposed to be free, mark it as allocated
379 * - 2: just check that cookie is valid (free or allocated)
381 void rte_mempool_contig_blocks_check_cookies(const struct rte_mempool *mp,
382 void * const *first_obj_table_const, unsigned int n, int free);
384 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
385 #define __mempool_contig_blocks_check_cookies(mp, first_obj_table_const, n, \
387 rte_mempool_contig_blocks_check_cookies(mp, first_obj_table_const, n, \
390 #define __mempool_contig_blocks_check_cookies(mp, first_obj_table_const, n, \
393 #endif /* RTE_LIBRTE_MEMPOOL_DEBUG */
395 #define RTE_MEMPOOL_OPS_NAMESIZE 32 /**< Max length of ops struct name. */
398 * Prototype for implementation specific data provisioning function.
400 * The function should provide the implementation specific memory for
401 * use by the other mempool ops functions in a given mempool ops struct.
402 * E.g. the default ops provides an instance of the rte_ring for this purpose.
403 * it will most likely point to a different type of data structure, and
404 * will be transparent to the application programmer.
405 * This function should set mp->pool_data.
407 typedef int (*rte_mempool_alloc_t)(struct rte_mempool *mp);
410 * Free the opaque private data pointed to by mp->pool_data pointer.
412 typedef void (*rte_mempool_free_t)(struct rte_mempool *mp);
415 * Enqueue an object into the external pool.
417 typedef int (*rte_mempool_enqueue_t)(struct rte_mempool *mp,
418 void * const *obj_table, unsigned int n);
421 * Dequeue an object from the external pool.
423 typedef int (*rte_mempool_dequeue_t)(struct rte_mempool *mp,
424 void **obj_table, unsigned int n);
428 * @b EXPERIMENTAL: this API may change without prior notice.
430 * Dequeue a number of contiguous object blocks from the external pool.
432 typedef int (*rte_mempool_dequeue_contig_blocks_t)(struct rte_mempool *mp,
433 void **first_obj_table, unsigned int n);
436 * Return the number of available objects in the external pool.
438 typedef unsigned (*rte_mempool_get_count)(const struct rte_mempool *mp);
441 * Calculate memory size required to store given number of objects.
443 * If mempool objects are not required to be IOVA-contiguous
444 * (the flag MEMPOOL_F_NO_IOVA_CONTIG is set), min_chunk_size defines
445 * virtually contiguous chunk size. Otherwise, if mempool objects must
446 * be IOVA-contiguous (the flag MEMPOOL_F_NO_IOVA_CONTIG is clear),
447 * min_chunk_size defines IOVA-contiguous chunk size.
450 * Pointer to the memory pool.
453 * @param[in] pg_shift
454 * LOG2 of the physical pages size. If set to 0, ignore page boundaries.
455 * @param[out] min_chunk_size
456 * Location for minimum size of the memory chunk which may be used to
457 * store memory pool objects.
459 * Location for required memory chunk alignment.
461 * Required memory size.
463 typedef ssize_t (*rte_mempool_calc_mem_size_t)(const struct rte_mempool *mp,
464 uint32_t obj_num, uint32_t pg_shift,
465 size_t *min_chunk_size, size_t *align);
468 * Default way to calculate memory size required to store given number of
471 * If page boundaries may be ignored, it is just a product of total
472 * object size including header and trailer and number of objects.
473 * Otherwise, it is a number of pages required to store given number of
474 * objects without crossing page boundary.
476 * Note that if object size is bigger than page size, then it assumes
477 * that pages are grouped in subsets of physically continuous pages big
478 * enough to store at least one object.
480 * Minimum size of memory chunk is the total element size.
481 * Required memory chunk alignment is the cache line size.
483 ssize_t rte_mempool_op_calc_mem_size_default(const struct rte_mempool *mp,
484 uint32_t obj_num, uint32_t pg_shift,
485 size_t *min_chunk_size, size_t *align);
488 * Function to be called for each populated object.
491 * A pointer to the mempool structure.
493 * An opaque pointer passed to iterator.
495 * Object virtual address.
497 * Input/output virtual address of the object or RTE_BAD_IOVA.
499 typedef void (rte_mempool_populate_obj_cb_t)(struct rte_mempool *mp,
500 void *opaque, void *vaddr, rte_iova_t iova);
503 * Populate memory pool objects using provided memory chunk.
505 * Populated objects should be enqueued to the pool, e.g. using
506 * rte_mempool_ops_enqueue_bulk().
508 * If the given IO address is unknown (iova = RTE_BAD_IOVA),
509 * the chunk doesn't need to be physically contiguous (only virtually),
510 * and allocated objects may span two pages.
513 * A pointer to the mempool structure.
514 * @param[in] max_objs
515 * Maximum number of objects to be populated.
517 * The virtual address of memory that should be used to store objects.
521 * The length of memory in bytes.
523 * Callback function to be executed for each populated object.
524 * @param[in] obj_cb_arg
525 * An opaque pointer passed to the callback function.
527 * The number of objects added on success.
528 * On error, no objects are populated and a negative errno is returned.
530 typedef int (*rte_mempool_populate_t)(struct rte_mempool *mp,
531 unsigned int max_objs,
532 void *vaddr, rte_iova_t iova, size_t len,
533 rte_mempool_populate_obj_cb_t *obj_cb, void *obj_cb_arg);
536 * Default way to populate memory pool object using provided memory
537 * chunk: just slice objects one by one.
539 int rte_mempool_op_populate_default(struct rte_mempool *mp,
540 unsigned int max_objs,
541 void *vaddr, rte_iova_t iova, size_t len,
542 rte_mempool_populate_obj_cb_t *obj_cb, void *obj_cb_arg);
546 * @b EXPERIMENTAL: this API may change without prior notice.
548 * Get some additional information about a mempool.
550 typedef int (*rte_mempool_get_info_t)(const struct rte_mempool *mp,
551 struct rte_mempool_info *info);
554 /** Structure defining mempool operations structure */
555 struct rte_mempool_ops {
556 char name[RTE_MEMPOOL_OPS_NAMESIZE]; /**< Name of mempool ops struct. */
557 rte_mempool_alloc_t alloc; /**< Allocate private data. */
558 rte_mempool_free_t free; /**< Free the external pool. */
559 rte_mempool_enqueue_t enqueue; /**< Enqueue an object. */
560 rte_mempool_dequeue_t dequeue; /**< Dequeue an object. */
561 rte_mempool_get_count get_count; /**< Get qty of available objs. */
563 * Optional callback to calculate memory size required to
564 * store specified number of objects.
566 rte_mempool_calc_mem_size_t calc_mem_size;
568 * Optional callback to populate mempool objects using
569 * provided memory chunk.
571 rte_mempool_populate_t populate;
575 rte_mempool_get_info_t get_info;
577 * Dequeue a number of contiguous object blocks.
579 rte_mempool_dequeue_contig_blocks_t dequeue_contig_blocks;
580 } __rte_cache_aligned;
582 #define RTE_MEMPOOL_MAX_OPS_IDX 16 /**< Max registered ops structs */
585 * Structure storing the table of registered ops structs, each of which contain
586 * the function pointers for the mempool ops functions.
587 * Each process has its own storage for this ops struct array so that
588 * the mempools can be shared across primary and secondary processes.
589 * The indices used to access the array are valid across processes, whereas
590 * any function pointers stored directly in the mempool struct would not be.
591 * This results in us simply having "ops_index" in the mempool struct.
593 struct rte_mempool_ops_table {
594 rte_spinlock_t sl; /**< Spinlock for add/delete. */
595 uint32_t num_ops; /**< Number of used ops structs in the table. */
597 * Storage for all possible ops structs.
599 struct rte_mempool_ops ops[RTE_MEMPOOL_MAX_OPS_IDX];
600 } __rte_cache_aligned;
602 /** Array of registered ops structs. */
603 extern struct rte_mempool_ops_table rte_mempool_ops_table;
606 * @internal Get the mempool ops struct from its index.
609 * The index of the ops struct in the ops struct table. It must be a valid
610 * index: (0 <= idx < num_ops).
612 * The pointer to the ops struct in the table.
614 static inline struct rte_mempool_ops *
615 rte_mempool_get_ops(int ops_index)
617 RTE_VERIFY((ops_index >= 0) && (ops_index < RTE_MEMPOOL_MAX_OPS_IDX));
619 return &rte_mempool_ops_table.ops[ops_index];
623 * @internal Wrapper for mempool_ops alloc callback.
626 * Pointer to the memory pool.
628 * - 0: Success; successfully allocated mempool pool_data.
629 * - <0: Error; code of alloc function.
632 rte_mempool_ops_alloc(struct rte_mempool *mp);
635 * @internal Wrapper for mempool_ops dequeue callback.
638 * Pointer to the memory pool.
640 * Pointer to a table of void * pointers (objects).
642 * Number of objects to get.
644 * - 0: Success; got n objects.
645 * - <0: Error; code of dequeue function.
648 rte_mempool_ops_dequeue_bulk(struct rte_mempool *mp,
649 void **obj_table, unsigned n)
651 struct rte_mempool_ops *ops;
653 ops = rte_mempool_get_ops(mp->ops_index);
654 return ops->dequeue(mp, obj_table, n);
658 * @internal Wrapper for mempool_ops dequeue_contig_blocks callback.
661 * Pointer to the memory pool.
662 * @param[out] first_obj_table
663 * Pointer to a table of void * pointers (first objects).
665 * Number of blocks to get.
667 * - 0: Success; got n objects.
668 * - <0: Error; code of dequeue function.
671 rte_mempool_ops_dequeue_contig_blocks(struct rte_mempool *mp,
672 void **first_obj_table, unsigned int n)
674 struct rte_mempool_ops *ops;
676 ops = rte_mempool_get_ops(mp->ops_index);
677 RTE_ASSERT(ops->dequeue_contig_blocks != NULL);
678 return ops->dequeue_contig_blocks(mp, first_obj_table, n);
682 * @internal wrapper for mempool_ops enqueue callback.
685 * Pointer to the memory pool.
687 * Pointer to a table of void * pointers (objects).
689 * Number of objects to put.
691 * - 0: Success; n objects supplied.
692 * - <0: Error; code of enqueue function.
695 rte_mempool_ops_enqueue_bulk(struct rte_mempool *mp, void * const *obj_table,
698 struct rte_mempool_ops *ops;
700 ops = rte_mempool_get_ops(mp->ops_index);
701 return ops->enqueue(mp, obj_table, n);
705 * @internal wrapper for mempool_ops get_count callback.
708 * Pointer to the memory pool.
710 * The number of available objects in the external pool.
713 rte_mempool_ops_get_count(const struct rte_mempool *mp);
716 * @internal wrapper for mempool_ops calc_mem_size callback.
717 * API to calculate size of memory required to store specified number of
721 * Pointer to the memory pool.
724 * @param[in] pg_shift
725 * LOG2 of the physical pages size. If set to 0, ignore page boundaries.
726 * @param[out] min_chunk_size
727 * Location for minimum size of the memory chunk which may be used to
728 * store memory pool objects.
730 * Location for required memory chunk alignment.
732 * Required memory size aligned at page boundary.
734 ssize_t rte_mempool_ops_calc_mem_size(const struct rte_mempool *mp,
735 uint32_t obj_num, uint32_t pg_shift,
736 size_t *min_chunk_size, size_t *align);
739 * @internal wrapper for mempool_ops populate callback.
741 * Populate memory pool objects using provided memory chunk.
744 * A pointer to the mempool structure.
745 * @param[in] max_objs
746 * Maximum number of objects to be populated.
748 * The virtual address of memory that should be used to store objects.
752 * The length of memory in bytes.
754 * Callback function to be executed for each populated object.
755 * @param[in] obj_cb_arg
756 * An opaque pointer passed to the callback function.
758 * The number of objects added on success.
759 * On error, no objects are populated and a negative errno is returned.
761 int rte_mempool_ops_populate(struct rte_mempool *mp, unsigned int max_objs,
762 void *vaddr, rte_iova_t iova, size_t len,
763 rte_mempool_populate_obj_cb_t *obj_cb,
768 * @b EXPERIMENTAL: this API may change without prior notice.
770 * Wrapper for mempool_ops get_info callback.
773 * Pointer to the memory pool.
775 * Pointer to the rte_mempool_info structure
777 * - 0: Success; The mempool driver supports retrieving supplementary
778 * mempool information
779 * - -ENOTSUP - doesn't support get_info ops (valid case).
782 int rte_mempool_ops_get_info(const struct rte_mempool *mp,
783 struct rte_mempool_info *info);
786 * @internal wrapper for mempool_ops free callback.
789 * Pointer to the memory pool.
792 rte_mempool_ops_free(struct rte_mempool *mp);
795 * Set the ops of a mempool.
797 * This can only be done on a mempool that is not populated, i.e. just after
798 * a call to rte_mempool_create_empty().
801 * Pointer to the memory pool.
803 * Name of the ops structure to use for this mempool.
805 * Opaque data that can be passed by the application to the ops functions.
807 * - 0: Success; the mempool is now using the requested ops functions.
808 * - -EINVAL - Invalid ops struct name provided.
809 * - -EEXIST - mempool already has an ops struct assigned.
812 rte_mempool_set_ops_byname(struct rte_mempool *mp, const char *name,
816 * Register mempool operations.
819 * Pointer to an ops structure to register.
821 * - >=0: Success; return the index of the ops struct in the table.
822 * - -EINVAL - some missing callbacks while registering ops struct.
823 * - -ENOSPC - the maximum number of ops structs has been reached.
825 int rte_mempool_register_ops(const struct rte_mempool_ops *ops);
828 * Macro to statically register the ops of a mempool handler.
829 * Note that the rte_mempool_register_ops fails silently here when
830 * more than RTE_MEMPOOL_MAX_OPS_IDX is registered.
832 #define MEMPOOL_REGISTER_OPS(ops) \
833 RTE_INIT(mp_hdlr_init_##ops) \
835 rte_mempool_register_ops(&ops); \
839 * An object callback function for mempool.
841 * Used by rte_mempool_create() and rte_mempool_obj_iter().
843 typedef void (rte_mempool_obj_cb_t)(struct rte_mempool *mp,
844 void *opaque, void *obj, unsigned obj_idx);
845 typedef rte_mempool_obj_cb_t rte_mempool_obj_ctor_t; /* compat */
848 * A memory callback function for mempool.
850 * Used by rte_mempool_mem_iter().
852 typedef void (rte_mempool_mem_cb_t)(struct rte_mempool *mp,
853 void *opaque, struct rte_mempool_memhdr *memhdr,
857 * A mempool constructor callback function.
859 * Arguments are the mempool and the opaque pointer given by the user in
860 * rte_mempool_create().
862 typedef void (rte_mempool_ctor_t)(struct rte_mempool *, void *);
865 * Create a new mempool named *name* in memory.
867 * This function uses ``rte_memzone_reserve()`` to allocate memory. The
868 * pool contains n elements of elt_size. Its size is set to n.
871 * The name of the mempool.
873 * The number of elements in the mempool. The optimum size (in terms of
874 * memory usage) for a mempool is when n is a power of two minus one:
877 * The size of each element.
879 * If cache_size is non-zero, the rte_mempool library will try to
880 * limit the accesses to the common lockless pool, by maintaining a
881 * per-lcore object cache. This argument must be lower or equal to
882 * CONFIG_RTE_MEMPOOL_CACHE_MAX_SIZE and n / 1.5. It is advised to choose
883 * cache_size to have "n modulo cache_size == 0": if this is
884 * not the case, some elements will always stay in the pool and will
885 * never be used. The access to the per-lcore table is of course
886 * faster than the multi-producer/consumer pool. The cache can be
887 * disabled if the cache_size argument is set to 0; it can be useful to
888 * avoid losing objects in cache.
889 * @param private_data_size
890 * The size of the private data appended after the mempool
891 * structure. This is useful for storing some private data after the
892 * mempool structure, as is done for rte_mbuf_pool for example.
894 * A function pointer that is called for initialization of the pool,
895 * before object initialization. The user can initialize the private
896 * data in this function if needed. This parameter can be NULL if
899 * An opaque pointer to data that can be used in the mempool
900 * constructor function.
902 * A function pointer that is called for each object at
903 * initialization of the pool. The user can set some meta data in
904 * objects if needed. This parameter can be NULL if not needed.
905 * The obj_init() function takes the mempool pointer, the init_arg,
906 * the object pointer and the object number as parameters.
907 * @param obj_init_arg
908 * An opaque pointer to data that can be used as an argument for
909 * each call to the object constructor function.
911 * The *socket_id* argument is the socket identifier in the case of
912 * NUMA. The value can be *SOCKET_ID_ANY* if there is no NUMA
913 * constraint for the reserved zone.
915 * The *flags* arguments is an OR of following flags:
916 * - MEMPOOL_F_NO_SPREAD: By default, objects addresses are spread
917 * between channels in RAM: the pool allocator will add padding
918 * between objects depending on the hardware configuration. See
919 * Memory alignment constraints for details. If this flag is set,
920 * the allocator will just align them to a cache line.
921 * - MEMPOOL_F_NO_CACHE_ALIGN: By default, the returned objects are
922 * cache-aligned. This flag removes this constraint, and no
923 * padding will be present between objects. This flag implies
924 * MEMPOOL_F_NO_SPREAD.
925 * - MEMPOOL_F_SP_PUT: If this flag is set, the default behavior
926 * when using rte_mempool_put() or rte_mempool_put_bulk() is
927 * "single-producer". Otherwise, it is "multi-producers".
928 * - MEMPOOL_F_SC_GET: If this flag is set, the default behavior
929 * when using rte_mempool_get() or rte_mempool_get_bulk() is
930 * "single-consumer". Otherwise, it is "multi-consumers".
931 * - MEMPOOL_F_NO_IOVA_CONTIG: If set, allocated objects won't
932 * necessarily be contiguous in IO memory.
934 * The pointer to the new allocated mempool, on success. NULL on error
935 * with rte_errno set appropriately. Possible rte_errno values include:
936 * - E_RTE_NO_CONFIG - function could not get pointer to rte_config structure
937 * - E_RTE_SECONDARY - function was called from a secondary process instance
938 * - EINVAL - cache size provided is too large
939 * - ENOSPC - the maximum number of memzones has already been allocated
940 * - EEXIST - a memzone with the same name already exists
941 * - ENOMEM - no appropriate memory area found in which to create memzone
944 rte_mempool_create(const char *name, unsigned n, unsigned elt_size,
945 unsigned cache_size, unsigned private_data_size,
946 rte_mempool_ctor_t *mp_init, void *mp_init_arg,
947 rte_mempool_obj_cb_t *obj_init, void *obj_init_arg,
948 int socket_id, unsigned flags);
951 * Create an empty mempool
953 * The mempool is allocated and initialized, but it is not populated: no
954 * memory is allocated for the mempool elements. The user has to call
955 * rte_mempool_populate_*() to add memory chunks to the pool. Once
956 * populated, the user may also want to initialize each object with
957 * rte_mempool_obj_iter().
960 * The name of the mempool.
962 * The maximum number of elements that can be added in the mempool.
963 * The optimum size (in terms of memory usage) for a mempool is when n
964 * is a power of two minus one: n = (2^q - 1).
966 * The size of each element.
968 * Size of the cache. See rte_mempool_create() for details.
969 * @param private_data_size
970 * The size of the private data appended after the mempool
971 * structure. This is useful for storing some private data after the
972 * mempool structure, as is done for rte_mbuf_pool for example.
974 * The *socket_id* argument is the socket identifier in the case of
975 * NUMA. The value can be *SOCKET_ID_ANY* if there is no NUMA
976 * constraint for the reserved zone.
978 * Flags controlling the behavior of the mempool. See
979 * rte_mempool_create() for details.
981 * The pointer to the new allocated mempool, on success. NULL on error
982 * with rte_errno set appropriately. See rte_mempool_create() for details.
985 rte_mempool_create_empty(const char *name, unsigned n, unsigned elt_size,
986 unsigned cache_size, unsigned private_data_size,
987 int socket_id, unsigned flags);
991 * Unlink the mempool from global list, free the memory chunks, and all
992 * memory referenced by the mempool. The objects must not be used by
993 * other cores as they will be freed.
996 * A pointer to the mempool structure.
999 rte_mempool_free(struct rte_mempool *mp);
1002 * Add physically contiguous memory for objects in the pool at init
1004 * Add a virtually and physically contiguous memory chunk in the pool
1005 * where objects can be instantiated.
1007 * If the given IO address is unknown (iova = RTE_BAD_IOVA),
1008 * the chunk doesn't need to be physically contiguous (only virtually),
1009 * and allocated objects may span two pages.
1012 * A pointer to the mempool structure.
1014 * The virtual address of memory that should be used to store objects.
1018 * The length of memory in bytes.
1020 * The callback used to free this chunk when destroying the mempool.
1022 * An opaque argument passed to free_cb.
1024 * The number of objects added on success.
1025 * On error, the chunk is not added in the memory list of the
1026 * mempool and a negative errno is returned.
1028 int rte_mempool_populate_iova(struct rte_mempool *mp, char *vaddr,
1029 rte_iova_t iova, size_t len, rte_mempool_memchunk_free_cb_t *free_cb,
1033 * Add virtually contiguous memory for objects in the pool at init
1035 * Add a virtually contiguous memory chunk in the pool where objects can
1039 * A pointer to the mempool structure.
1041 * The virtual address of memory that should be used to store objects.
1043 * The length of memory in bytes.
1045 * The size of memory pages in this virtual area.
1047 * The callback used to free this chunk when destroying the mempool.
1049 * An opaque argument passed to free_cb.
1051 * The number of objects added on success.
1052 * On error, the chunk is not added in the memory list of the
1053 * mempool and a negative errno is returned.
1056 rte_mempool_populate_virt(struct rte_mempool *mp, char *addr,
1057 size_t len, size_t pg_sz, rte_mempool_memchunk_free_cb_t *free_cb,
1061 * Add memory for objects in the pool at init
1063 * This is the default function used by rte_mempool_create() to populate
1064 * the mempool. It adds memory allocated using rte_memzone_reserve().
1067 * A pointer to the mempool structure.
1069 * The number of objects added on success.
1070 * On error, the chunk is not added in the memory list of the
1071 * mempool and a negative errno is returned.
1073 int rte_mempool_populate_default(struct rte_mempool *mp);
1076 * Add memory from anonymous mapping for objects in the pool at init
1078 * This function mmap an anonymous memory zone that is locked in
1079 * memory to store the objects of the mempool.
1082 * A pointer to the mempool structure.
1084 * The number of objects added on success.
1085 * On error, the chunk is not added in the memory list of the
1086 * mempool and a negative errno is returned.
1088 int rte_mempool_populate_anon(struct rte_mempool *mp);
1091 * Call a function for each mempool element
1093 * Iterate across all objects attached to a rte_mempool and call the
1094 * callback function on it.
1097 * A pointer to an initialized mempool.
1099 * A function pointer that is called for each object.
1101 * An opaque pointer passed to the callback function.
1103 * Number of objects iterated.
1105 uint32_t rte_mempool_obj_iter(struct rte_mempool *mp,
1106 rte_mempool_obj_cb_t *obj_cb, void *obj_cb_arg);
1109 * Call a function for each mempool memory chunk
1111 * Iterate across all memory chunks attached to a rte_mempool and call
1112 * the callback function on it.
1115 * A pointer to an initialized mempool.
1117 * A function pointer that is called for each memory chunk.
1119 * An opaque pointer passed to the callback function.
1121 * Number of memory chunks iterated.
1123 uint32_t rte_mempool_mem_iter(struct rte_mempool *mp,
1124 rte_mempool_mem_cb_t *mem_cb, void *mem_cb_arg);
1127 * Dump the status of the mempool to a file.
1130 * A pointer to a file for output
1132 * A pointer to the mempool structure.
1134 void rte_mempool_dump(FILE *f, struct rte_mempool *mp);
1137 * Create a user-owned mempool cache.
1139 * This can be used by non-EAL threads to enable caching when they
1140 * interact with a mempool.
1143 * The size of the mempool cache. See rte_mempool_create()'s cache_size
1144 * parameter description for more information. The same limits and
1145 * considerations apply here too.
1147 * The socket identifier in the case of NUMA. The value can be
1148 * SOCKET_ID_ANY if there is no NUMA constraint for the reserved zone.
1150 struct rte_mempool_cache *
1151 rte_mempool_cache_create(uint32_t size, int socket_id);
1154 * Free a user-owned mempool cache.
1157 * A pointer to the mempool cache.
1160 rte_mempool_cache_free(struct rte_mempool_cache *cache);
1163 * Get a pointer to the per-lcore default mempool cache.
1166 * A pointer to the mempool structure.
1168 * The logical core id.
1170 * A pointer to the mempool cache or NULL if disabled or non-EAL thread.
1172 static __rte_always_inline struct rte_mempool_cache *
1173 rte_mempool_default_cache(struct rte_mempool *mp, unsigned lcore_id)
1175 if (mp->cache_size == 0)
1178 if (lcore_id >= RTE_MAX_LCORE)
1181 return &mp->local_cache[lcore_id];
1185 * Flush a user-owned mempool cache to the specified mempool.
1188 * A pointer to the mempool cache.
1190 * A pointer to the mempool.
1192 static __rte_always_inline void
1193 rte_mempool_cache_flush(struct rte_mempool_cache *cache,
1194 struct rte_mempool *mp)
1197 cache = rte_mempool_default_cache(mp, rte_lcore_id());
1198 if (cache == NULL || cache->len == 0)
1200 rte_mempool_ops_enqueue_bulk(mp, cache->objs, cache->len);
1205 * @internal Put several objects back in the mempool; used internally.
1207 * A pointer to the mempool structure.
1209 * A pointer to a table of void * pointers (objects).
1211 * The number of objects to store back in the mempool, must be strictly
1214 * A pointer to a mempool cache structure. May be NULL if not needed.
1216 static __rte_always_inline void
1217 __mempool_generic_put(struct rte_mempool *mp, void * const *obj_table,
1218 unsigned int n, struct rte_mempool_cache *cache)
1222 /* increment stat now, adding in mempool always success */
1223 __MEMPOOL_STAT_ADD(mp, put, n);
1225 /* No cache provided or if put would overflow mem allocated for cache */
1226 if (unlikely(cache == NULL || n > RTE_MEMPOOL_CACHE_MAX_SIZE))
1229 cache_objs = &cache->objs[cache->len];
1232 * The cache follows the following algorithm
1233 * 1. Add the objects to the cache
1234 * 2. Anything greater than the cache min value (if it crosses the
1235 * cache flush threshold) is flushed to the ring.
1238 /* Add elements back into the cache */
1239 rte_memcpy(&cache_objs[0], obj_table, sizeof(void *) * n);
1243 if (cache->len >= cache->flushthresh) {
1244 rte_mempool_ops_enqueue_bulk(mp, &cache->objs[cache->size],
1245 cache->len - cache->size);
1246 cache->len = cache->size;
1253 /* push remaining objects in ring */
1254 #ifdef RTE_LIBRTE_MEMPOOL_DEBUG
1255 if (rte_mempool_ops_enqueue_bulk(mp, obj_table, n) < 0)
1256 rte_panic("cannot put objects in mempool\n");
1258 rte_mempool_ops_enqueue_bulk(mp, obj_table, n);
1264 * Put several objects back in the mempool.
1267 * A pointer to the mempool structure.
1269 * A pointer to a table of void * pointers (objects).
1271 * The number of objects to add in the mempool from the obj_table.
1273 * A pointer to a mempool cache structure. May be NULL if not needed.
1275 static __rte_always_inline void
1276 rte_mempool_generic_put(struct rte_mempool *mp, void * const *obj_table,
1277 unsigned int n, struct rte_mempool_cache *cache)
1279 __mempool_check_cookies(mp, obj_table, n, 0);
1280 __mempool_generic_put(mp, obj_table, n, cache);
1284 * Put several objects back in the mempool.
1286 * This function calls the multi-producer or the single-producer
1287 * version depending on the default behavior that was specified at
1288 * mempool creation time (see flags).
1291 * A pointer to the mempool structure.
1293 * A pointer to a table of void * pointers (objects).
1295 * The number of objects to add in the mempool from obj_table.
1297 static __rte_always_inline void
1298 rte_mempool_put_bulk(struct rte_mempool *mp, void * const *obj_table,
1301 struct rte_mempool_cache *cache;
1302 cache = rte_mempool_default_cache(mp, rte_lcore_id());
1303 rte_mempool_generic_put(mp, obj_table, n, cache);
1307 * Put one object back in the mempool.
1309 * This function calls the multi-producer or the single-producer
1310 * version depending on the default behavior that was specified at
1311 * mempool creation time (see flags).
1314 * A pointer to the mempool structure.
1316 * A pointer to the object to be added.
1318 static __rte_always_inline void
1319 rte_mempool_put(struct rte_mempool *mp, void *obj)
1321 rte_mempool_put_bulk(mp, &obj, 1);
1325 * @internal Get several objects from the mempool; used internally.
1327 * A pointer to the mempool structure.
1329 * A pointer to a table of void * pointers (objects).
1331 * The number of objects to get, must be strictly positive.
1333 * A pointer to a mempool cache structure. May be NULL if not needed.
1335 * - >=0: Success; number of objects supplied.
1336 * - <0: Error; code of ring dequeue function.
1338 static __rte_always_inline int
1339 __mempool_generic_get(struct rte_mempool *mp, void **obj_table,
1340 unsigned int n, struct rte_mempool_cache *cache)
1343 uint32_t index, len;
1346 /* No cache provided or cannot be satisfied from cache */
1347 if (unlikely(cache == NULL || n >= cache->size))
1350 cache_objs = cache->objs;
1352 /* Can this be satisfied from the cache? */
1353 if (cache->len < n) {
1354 /* No. Backfill the cache first, and then fill from it */
1355 uint32_t req = n + (cache->size - cache->len);
1357 /* How many do we require i.e. number to fill the cache + the request */
1358 ret = rte_mempool_ops_dequeue_bulk(mp,
1359 &cache->objs[cache->len], req);
1360 if (unlikely(ret < 0)) {
1362 * In the off chance that we are buffer constrained,
1363 * where we are not able to allocate cache + n, go to
1364 * the ring directly. If that fails, we are truly out of
1373 /* Now fill in the response ... */
1374 for (index = 0, len = cache->len - 1; index < n; ++index, len--, obj_table++)
1375 *obj_table = cache_objs[len];
1379 __MEMPOOL_STAT_ADD(mp, get_success, n);
1385 /* get remaining objects from ring */
1386 ret = rte_mempool_ops_dequeue_bulk(mp, obj_table, n);
1389 __MEMPOOL_STAT_ADD(mp, get_fail, n);
1391 __MEMPOOL_STAT_ADD(mp, get_success, n);
1397 * Get several objects from the mempool.
1399 * If cache is enabled, objects will be retrieved first from cache,
1400 * subsequently from the common pool. Note that it can return -ENOENT when
1401 * the local cache and common pool are empty, even if cache from other
1405 * A pointer to the mempool structure.
1407 * A pointer to a table of void * pointers (objects) that will be filled.
1409 * The number of objects to get from mempool to obj_table.
1411 * A pointer to a mempool cache structure. May be NULL if not needed.
1413 * - 0: Success; objects taken.
1414 * - -ENOENT: Not enough entries in the mempool; no object is retrieved.
1416 static __rte_always_inline int
1417 rte_mempool_generic_get(struct rte_mempool *mp, void **obj_table,
1418 unsigned int n, struct rte_mempool_cache *cache)
1421 ret = __mempool_generic_get(mp, obj_table, n, cache);
1423 __mempool_check_cookies(mp, obj_table, n, 1);
1428 * Get several objects from the mempool.
1430 * This function calls the multi-consumers or the single-consumer
1431 * version, depending on the default behaviour that was specified at
1432 * mempool creation time (see flags).
1434 * If cache is enabled, objects will be retrieved first from cache,
1435 * subsequently from the common pool. Note that it can return -ENOENT when
1436 * the local cache and common pool are empty, even if cache from other
1440 * A pointer to the mempool structure.
1442 * A pointer to a table of void * pointers (objects) that will be filled.
1444 * The number of objects to get from the mempool to obj_table.
1446 * - 0: Success; objects taken
1447 * - -ENOENT: Not enough entries in the mempool; no object is retrieved.
1449 static __rte_always_inline int
1450 rte_mempool_get_bulk(struct rte_mempool *mp, void **obj_table, unsigned int n)
1452 struct rte_mempool_cache *cache;
1453 cache = rte_mempool_default_cache(mp, rte_lcore_id());
1454 return rte_mempool_generic_get(mp, obj_table, n, cache);
1458 * Get one object from the mempool.
1460 * This function calls the multi-consumers or the single-consumer
1461 * version, depending on the default behavior that was specified at
1462 * mempool creation (see flags).
1464 * If cache is enabled, objects will be retrieved first from cache,
1465 * subsequently from the common pool. Note that it can return -ENOENT when
1466 * the local cache and common pool are empty, even if cache from other
1470 * A pointer to the mempool structure.
1472 * A pointer to a void * pointer (object) that will be filled.
1474 * - 0: Success; objects taken.
1475 * - -ENOENT: Not enough entries in the mempool; no object is retrieved.
1477 static __rte_always_inline int
1478 rte_mempool_get(struct rte_mempool *mp, void **obj_p)
1480 return rte_mempool_get_bulk(mp, obj_p, 1);
1485 * @b EXPERIMENTAL: this API may change without prior notice.
1487 * Get a contiguous blocks of objects from the mempool.
1489 * If cache is enabled, consider to flush it first, to reuse objects
1490 * as soon as possible.
1492 * The application should check that the driver supports the operation
1493 * by calling rte_mempool_ops_get_info() and checking that `contig_block_size`
1497 * A pointer to the mempool structure.
1498 * @param first_obj_table
1499 * A pointer to a pointer to the first object in each block.
1501 * The number of blocks to get from mempool.
1503 * - 0: Success; blocks taken.
1504 * - -ENOBUFS: Not enough entries in the mempool; no object is retrieved.
1505 * - -EOPNOTSUPP: The mempool driver does not support block dequeue
1507 static __rte_always_inline int
1509 rte_mempool_get_contig_blocks(struct rte_mempool *mp,
1510 void **first_obj_table, unsigned int n)
1514 ret = rte_mempool_ops_dequeue_contig_blocks(mp, first_obj_table, n);
1516 __MEMPOOL_CONTIG_BLOCKS_STAT_ADD(mp, get_success, n);
1517 __mempool_contig_blocks_check_cookies(mp, first_obj_table, n,
1520 __MEMPOOL_CONTIG_BLOCKS_STAT_ADD(mp, get_fail, n);
1527 * Return the number of entries in the mempool.
1529 * When cache is enabled, this function has to browse the length of
1530 * all lcores, so it should not be used in a data path, but only for
1531 * debug purposes. User-owned mempool caches are not accounted for.
1534 * A pointer to the mempool structure.
1536 * The number of entries in the mempool.
1538 unsigned int rte_mempool_avail_count(const struct rte_mempool *mp);
1541 * Return the number of elements which have been allocated from the mempool
1543 * When cache is enabled, this function has to browse the length of
1544 * all lcores, so it should not be used in a data path, but only for
1548 * A pointer to the mempool structure.
1550 * The number of free entries in the mempool.
1553 rte_mempool_in_use_count(const struct rte_mempool *mp);
1556 * Test if the mempool is full.
1558 * When cache is enabled, this function has to browse the length of all
1559 * lcores, so it should not be used in a data path, but only for debug
1560 * purposes. User-owned mempool caches are not accounted for.
1563 * A pointer to the mempool structure.
1565 * - 1: The mempool is full.
1566 * - 0: The mempool is not full.
1569 rte_mempool_full(const struct rte_mempool *mp)
1571 return !!(rte_mempool_avail_count(mp) == mp->size);
1575 * Test if the mempool is empty.
1577 * When cache is enabled, this function has to browse the length of all
1578 * lcores, so it should not be used in a data path, but only for debug
1579 * purposes. User-owned mempool caches are not accounted for.
1582 * A pointer to the mempool structure.
1584 * - 1: The mempool is empty.
1585 * - 0: The mempool is not empty.
1588 rte_mempool_empty(const struct rte_mempool *mp)
1590 return !!(rte_mempool_avail_count(mp) == 0);
1594 * Return the IO address of elt, which is an element of the pool mp.
1597 * A pointer (virtual address) to the element of the pool.
1599 * The IO address of the elt element.
1600 * If the mempool was created with MEMPOOL_F_NO_IOVA_CONTIG, the
1601 * returned value is RTE_BAD_IOVA.
1603 static inline rte_iova_t
1604 rte_mempool_virt2iova(const void *elt)
1606 const struct rte_mempool_objhdr *hdr;
1607 hdr = (const struct rte_mempool_objhdr *)RTE_PTR_SUB(elt,
1613 * Check the consistency of mempool objects.
1615 * Verify the coherency of fields in the mempool structure. Also check
1616 * that the cookies of mempool objects (even the ones that are not
1617 * present in pool) have a correct value. If not, a panic will occur.
1620 * A pointer to the mempool structure.
1622 void rte_mempool_audit(struct rte_mempool *mp);
1625 * Return a pointer to the private data in an mempool structure.
1628 * A pointer to the mempool structure.
1630 * A pointer to the private data.
1632 static inline void *rte_mempool_get_priv(struct rte_mempool *mp)
1635 MEMPOOL_HEADER_SIZE(mp, mp->cache_size);
1639 * Dump the status of all mempools on the console
1642 * A pointer to a file for output
1644 void rte_mempool_list_dump(FILE *f);
1647 * Search a mempool from its name
1650 * The name of the mempool.
1652 * The pointer to the mempool matching the name, or NULL if not found.
1654 * with rte_errno set appropriately. Possible rte_errno values include:
1655 * - ENOENT - required entry not available to return.
1658 struct rte_mempool *rte_mempool_lookup(const char *name);
1661 * Get the header, trailer and total size of a mempool element.
1663 * Given a desired size of the mempool element and mempool flags,
1664 * calculates header, trailer, body and total sizes of the mempool object.
1667 * The size of each element, without header and trailer.
1669 * The flags used for the mempool creation.
1670 * Consult rte_mempool_create() for more information about possible values.
1671 * The size of each element.
1673 * The calculated detailed size the mempool object. May be NULL.
1675 * Total size of the mempool object.
1677 uint32_t rte_mempool_calc_obj_size(uint32_t elt_size, uint32_t flags,
1678 struct rte_mempool_objsz *sz);
1681 * Walk list of all memory pools
1686 * Argument passed to iterator
1688 void rte_mempool_walk(void (*func)(struct rte_mempool *, void *arg),
1693 * @b EXPERIMENTAL: this API may change without prior notice.
1695 * @internal Get page size used for mempool object allocation.
1696 * This function is internal to mempool library and mempool drivers.
1700 rte_mempool_get_page_size(struct rte_mempool *mp, size_t *pg_sz);
1706 #endif /* _RTE_MEMPOOL_H_ */