Term ring is misleading since it is the default, but still just
one of possible drivers to store objects.

Signed-off-by: Andrew Rybchenko <andrew.rybche...@oktetlabs.ru>
Reviewed-by: Morten Brørup <m...@smartsharesystems.com>
---
 lib/mempool/rte_mempool.h | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/lib/mempool/rte_mempool.h b/lib/mempool/rte_mempool.h
index bc29d49aab..a072e5554b 100644
--- a/lib/mempool/rte_mempool.h
+++ b/lib/mempool/rte_mempool.h
@@ -1331,7 +1331,7 @@ rte_mempool_do_generic_put(struct rte_mempool *mp, void * 
const *obj_table,
 
        /* No cache provided or if put would overflow mem allocated for cache */
        if (unlikely(cache == NULL || n > RTE_MEMPOOL_CACHE_MAX_SIZE))
-               goto ring_enqueue;
+               goto driver_enqueue;
 
        cache_objs = &cache->objs[cache->len];
 
@@ -1339,7 +1339,7 @@ rte_mempool_do_generic_put(struct rte_mempool *mp, void * 
const *obj_table,
         * The cache follows the following algorithm
         *   1. Add the objects to the cache
         *   2. Anything greater than the cache min value (if it crosses the
-        *   cache flush threshold) is flushed to the ring.
+        *   cache flush threshold) is flushed to the backend.
         */
 
        /* Add elements back into the cache */
@@ -1355,9 +1355,9 @@ rte_mempool_do_generic_put(struct rte_mempool *mp, void * 
const *obj_table,
 
        return;
 
-ring_enqueue:
+driver_enqueue:
 
-       /* push remaining objects in ring */
+       /* push objects to the backend */
        rte_mempool_ops_enqueue_bulk(mp, obj_table, n);
 }
 
-- 
2.30.2

Reply via email to