rte_stack_std.h

/* SPDX-License-Identifier: BSD-3-Clause
 * Copyright(c) 2019 Intel Corporation
 */
 
#ifndef _RTE_STACK_STD_H_
#define _RTE_STACK_STD_H_
 
#include <rte_branch_prediction.h>

static __rte_always_inline unsigned int
__rte_stack_std_push(struct rte_stack *s, void * const *obj_table,
             unsigned int n)
{
    struct rte_stack_std *stack = &s->stack_std;
    unsigned int index;
    void **cache_objs;
 
    rte_spinlock_lock(&stack->lock);
    cache_objs = &stack->objs[stack->len];
 
    /* Is there sufficient space in the stack? */
    if ((stack->len + n) > s->capacity) {
        rte_spinlock_unlock(&stack->lock);
        return 0;
    }
 
    /* Add elements back into the cache */
    for (index = 0; index < n; ++index, obj_table++)
        cache_objs[index] = *obj_table;
 
    stack->len += n;
 
    rte_spinlock_unlock(&stack->lock);
    return n;
}

static __rte_always_inline unsigned int
__rte_stack_std_pop(struct rte_stack *s, void **obj_table, unsigned int n)
{
    struct rte_stack_std *stack = &s->stack_std;
    unsigned int index, len;
    void **cache_objs;
 
    rte_spinlock_lock(&stack->lock);
 
    if (unlikely(n > stack->len)) {
        rte_spinlock_unlock(&stack->lock);
        return 0;
    }
 
    cache_objs = stack->objs;
 
    for (index = 0, len = stack->len - 1; index < n;
            ++index, len--, obj_table++)
        *obj_table = cache_objs[len];
 
    stack->len -= n;
    rte_spinlock_unlock(&stack->lock);
 
    return n;
}

static __rte_always_inline unsigned int
__rte_stack_std_count(struct rte_stack *s)
{
    return (unsigned int)s->stack_std.len;
}

void
rte_stack_std_init(struct rte_stack *s);

ssize_t
rte_stack_std_get_memsize(unsigned int count);
 
#endif /* _RTE_STACK_STD_H_ */