dpdk-fm10k/lib/librte_ring/rte_ring_peek_c11_mem.h
Feifei Wang 708d904451 ring: fix tail in peek API for ST mode
The value of *tail should be the prod->tail not prod->head. After
modification, it can record 'tail' so head/tail can be updated
accordingly.

Fixes: 664ff4b172 ("ring: introduce peek style API")

Signed-off-by: Feifei Wang <feifei.wang2@arm.com>
Reviewed-by: Ruifeng Wang <ruifeng.wang@arm.com>
Acked-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
2020-07-01 10:41:19 +02:00

111 lines
2.9 KiB
C

/* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2010-2020 Intel Corporation
* Copyright (c) 2007-2009 Kip Macy kmacy@freebsd.org
* All rights reserved.
* Derived from FreeBSD's bufring.h
* Used as BSD-3 Licensed with permission from Kip Macy.
*/
#ifndef _RTE_RING_PEEK_C11_MEM_H_
#define _RTE_RING_PEEK_C11_MEM_H_
/**
* @file rte_ring_peek_c11_mem.h
* It is not recommended to include this file directly,
* include <rte_ring.h> instead.
* Contains internal helper functions for rte_ring peek API.
* For more information please refer to <rte_ring_peek.h>.
*/
/**
* @internal get current tail value.
* This function should be used only for single thread producer/consumer.
* Check that user didn't request to move tail above the head.
* In that situation:
* - return zero, that will cause abort any pending changes and
* return head to its previous position.
* - throw an assert in debug mode.
*/
static __rte_always_inline uint32_t
__rte_ring_st_get_tail(struct rte_ring_headtail *ht, uint32_t *tail,
uint32_t num)
{
uint32_t h, n, t;
h = ht->head;
t = ht->tail;
n = h - t;
RTE_ASSERT(n >= num);
num = (n >= num) ? num : 0;
*tail = t;
return num;
}
/**
* @internal set new values for head and tail.
* This function should be used only for single thread producer/consumer.
* Should be used only in conjunction with __rte_ring_st_get_tail.
*/
static __rte_always_inline void
__rte_ring_st_set_head_tail(struct rte_ring_headtail *ht, uint32_t tail,
uint32_t num, uint32_t enqueue)
{
uint32_t pos;
RTE_SET_USED(enqueue);
pos = tail + num;
ht->head = pos;
__atomic_store_n(&ht->tail, pos, __ATOMIC_RELEASE);
}
/**
* @internal get current tail value.
* This function should be used only for producer/consumer in MT_HTS mode.
* Check that user didn't request to move tail above the head.
* In that situation:
* - return zero, that will cause abort any pending changes and
* return head to its previous position.
* - throw an assert in debug mode.
*/
static __rte_always_inline uint32_t
__rte_ring_hts_get_tail(struct rte_ring_hts_headtail *ht, uint32_t *tail,
uint32_t num)
{
uint32_t n;
union __rte_ring_hts_pos p;
p.raw = __atomic_load_n(&ht->ht.raw, __ATOMIC_RELAXED);
n = p.pos.head - p.pos.tail;
RTE_ASSERT(n >= num);
num = (n >= num) ? num : 0;
*tail = p.pos.tail;
return num;
}
/**
* @internal set new values for head and tail as one atomic 64 bit operation.
* This function should be used only for producer/consumer in MT_HTS mode.
* Should be used only in conjunction with __rte_ring_hts_get_tail.
*/
static __rte_always_inline void
__rte_ring_hts_set_head_tail(struct rte_ring_hts_headtail *ht, uint32_t tail,
uint32_t num, uint32_t enqueue)
{
union __rte_ring_hts_pos p;
RTE_SET_USED(enqueue);
p.pos.head = tail + num;
p.pos.tail = p.pos.head;
__atomic_store_n(&ht->ht.raw, p.raw, __ATOMIC_RELEASE);
}
#endif /* _RTE_RING_PEEK_C11_MEM_H_ */