mempool/stack: use stack library

The new rte_stack library is derived from the mempool handler, so this
commit removes duplicated code and simplifies the handler by migrating it
to this new API.

Signed-off-by: Gage Eads <gage.eads@intel.com>
Reviewed-by: Olivier Matz <olivier.matz@6wind.com>
This commit is contained in:
Gage Eads 2019-04-03 18:20:14 -05:00 committed by Thomas Monjalon
parent 05d3b5283c
commit 734bdeb01c
4 changed files with 32 additions and 70 deletions

View File

@ -303,7 +303,6 @@ M: Andrew Rybchenko <arybchenko@solarflare.com>
F: lib/librte_mempool/ F: lib/librte_mempool/
F: drivers/mempool/Makefile F: drivers/mempool/Makefile
F: drivers/mempool/ring/ F: drivers/mempool/ring/
F: drivers/mempool/stack/
F: doc/guides/prog_guide/mempool_lib.rst F: doc/guides/prog_guide/mempool_lib.rst
F: app/test/test_mempool* F: app/test/test_mempool*
F: app/test/test_func_reentrancy.c F: app/test/test_func_reentrancy.c
@ -319,6 +318,7 @@ Stack - EXPERIMENTAL
M: Gage Eads <gage.eads@intel.com> M: Gage Eads <gage.eads@intel.com>
M: Olivier Matz <olivier.matz@6wind.com> M: Olivier Matz <olivier.matz@6wind.com>
F: lib/librte_stack/ F: lib/librte_stack/
F: drivers/mempool/stack/
F: doc/guides/prog_guide/stack_lib.rst F: doc/guides/prog_guide/stack_lib.rst
Packet buffer Packet buffer

View File

@ -10,10 +10,11 @@ LIB = librte_mempool_stack.a
CFLAGS += -O3 CFLAGS += -O3
CFLAGS += $(WERROR_FLAGS) CFLAGS += $(WERROR_FLAGS)
CFLAGS += -DALLOW_EXPERIMENTAL_API
# Headers # Headers
CFLAGS += -I$(RTE_SDK)/lib/librte_mempool CFLAGS += -I$(RTE_SDK)/lib/librte_mempool
LDLIBS += -lrte_eal -lrte_mempool -lrte_ring LDLIBS += -lrte_eal -lrte_mempool -lrte_stack
EXPORT_MAP := rte_mempool_stack_version.map EXPORT_MAP := rte_mempool_stack_version.map

View File

@ -1,4 +1,8 @@
# SPDX-License-Identifier: BSD-3-Clause # SPDX-License-Identifier: BSD-3-Clause
# Copyright(c) 2017 Intel Corporation # Copyright(c) 2017-2019 Intel Corporation
allow_experimental_apis = true
sources = files('rte_mempool_stack.c') sources = files('rte_mempool_stack.c')
deps += ['stack']

View File

@ -1,39 +1,29 @@
/* SPDX-License-Identifier: BSD-3-Clause /* SPDX-License-Identifier: BSD-3-Clause
* Copyright(c) 2016 Intel Corporation * Copyright(c) 2016-2019 Intel Corporation
*/ */
#include <stdio.h> #include <stdio.h>
#include <rte_mempool.h> #include <rte_mempool.h>
#include <rte_malloc.h> #include <rte_stack.h>
struct rte_mempool_stack {
rte_spinlock_t sl;
uint32_t size;
uint32_t len;
void *objs[];
};
static int static int
stack_alloc(struct rte_mempool *mp) stack_alloc(struct rte_mempool *mp)
{ {
struct rte_mempool_stack *s; char name[RTE_STACK_NAMESIZE];
unsigned n = mp->size; struct rte_stack *s;
int size = sizeof(*s) + (n+16)*sizeof(void *); int ret;
/* Allocate our local memory structure */ ret = snprintf(name, sizeof(name),
s = rte_zmalloc_socket("mempool-stack", RTE_MEMPOOL_MZ_FORMAT, mp->name);
size, if (ret < 0 || ret >= (int)sizeof(name)) {
RTE_CACHE_LINE_SIZE, rte_errno = ENAMETOOLONG;
mp->socket_id); return -rte_errno;
if (s == NULL) {
RTE_LOG(ERR, MEMPOOL, "Cannot allocate stack!\n");
return -ENOMEM;
} }
rte_spinlock_init(&s->sl); s = rte_stack_create(name, mp->size, mp->socket_id, 0);
if (s == NULL)
return -rte_errno;
s->size = n;
mp->pool_data = s; mp->pool_data = s;
return 0; return 0;
@ -41,69 +31,36 @@ stack_alloc(struct rte_mempool *mp)
static int static int
stack_enqueue(struct rte_mempool *mp, void * const *obj_table, stack_enqueue(struct rte_mempool *mp, void * const *obj_table,
unsigned n) unsigned int n)
{ {
struct rte_mempool_stack *s = mp->pool_data; struct rte_stack *s = mp->pool_data;
void **cache_objs;
unsigned index;
rte_spinlock_lock(&s->sl); return rte_stack_push(s, obj_table, n) == 0 ? -ENOBUFS : 0;
cache_objs = &s->objs[s->len];
/* Is there sufficient space in the stack ? */
if ((s->len + n) > s->size) {
rte_spinlock_unlock(&s->sl);
return -ENOBUFS;
}
/* Add elements back into the cache */
for (index = 0; index < n; ++index, obj_table++)
cache_objs[index] = *obj_table;
s->len += n;
rte_spinlock_unlock(&s->sl);
return 0;
} }
static int static int
stack_dequeue(struct rte_mempool *mp, void **obj_table, stack_dequeue(struct rte_mempool *mp, void **obj_table,
unsigned n) unsigned int n)
{ {
struct rte_mempool_stack *s = mp->pool_data; struct rte_stack *s = mp->pool_data;
void **cache_objs;
unsigned index, len;
rte_spinlock_lock(&s->sl); return rte_stack_pop(s, obj_table, n) == 0 ? -ENOBUFS : 0;
if (unlikely(n > s->len)) {
rte_spinlock_unlock(&s->sl);
return -ENOENT;
}
cache_objs = s->objs;
for (index = 0, len = s->len - 1; index < n;
++index, len--, obj_table++)
*obj_table = cache_objs[len];
s->len -= n;
rte_spinlock_unlock(&s->sl);
return 0;
} }
static unsigned static unsigned
stack_get_count(const struct rte_mempool *mp) stack_get_count(const struct rte_mempool *mp)
{ {
struct rte_mempool_stack *s = mp->pool_data; struct rte_stack *s = mp->pool_data;
return s->len; return rte_stack_count(s);
} }
static void static void
stack_free(struct rte_mempool *mp) stack_free(struct rte_mempool *mp)
{ {
rte_free((void *)(mp->pool_data)); struct rte_stack *s = mp->pool_data;
rte_stack_free(s);
} }
static struct rte_mempool_ops ops_stack = { static struct rte_mempool_ops ops_stack = {