2018-01-09 15:12:28 +00:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
|
|
|
/*
|
|
|
|
* Copyright(c) 2010-2014 Intel Corporation.
|
2013-09-18 10:00:00 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _KNI_FIFO_H_
|
|
|
|
#define _KNI_FIFO_H_
|
|
|
|
|
2019-04-01 23:07:12 +00:00
|
|
|
#include <rte_kni_common.h>
|
2013-09-18 10:00:00 +00:00
|
|
|
|
2018-10-26 21:23:36 +00:00
|
|
|
/* Skip some memory barriers on Linux < 3.14 */
|
|
|
|
#ifndef smp_load_acquire
|
|
|
|
#define smp_load_acquire(a) (*(a))
|
|
|
|
#endif
|
|
|
|
#ifndef smp_store_release
|
|
|
|
#define smp_store_release(a, b) *(a) = (b)
|
|
|
|
#endif
|
|
|
|
|
2013-09-18 10:00:00 +00:00
|
|
|
/**
|
|
|
|
* Adds num elements into the fifo. Return the number actually written
|
|
|
|
*/
|
2016-09-26 15:39:37 +00:00
|
|
|
static inline uint32_t
|
|
|
|
kni_fifo_put(struct rte_kni_fifo *fifo, void **data, uint32_t num)
|
2013-09-18 10:00:00 +00:00
|
|
|
{
|
2016-09-26 15:39:37 +00:00
|
|
|
uint32_t i = 0;
|
|
|
|
uint32_t fifo_write = fifo->write;
|
2018-10-08 09:11:45 +00:00
|
|
|
uint32_t fifo_read = smp_load_acquire(&fifo->read);
|
2016-09-26 15:39:37 +00:00
|
|
|
uint32_t new_write = fifo_write;
|
2013-09-18 10:00:00 +00:00
|
|
|
|
|
|
|
for (i = 0; i < num; i++) {
|
|
|
|
new_write = (new_write + 1) & (fifo->len - 1);
|
|
|
|
|
|
|
|
if (new_write == fifo_read)
|
|
|
|
break;
|
|
|
|
fifo->buffer[fifo_write] = data[i];
|
|
|
|
fifo_write = new_write;
|
|
|
|
}
|
2018-10-08 09:11:45 +00:00
|
|
|
smp_store_release(&fifo->write, fifo_write);
|
2013-09-18 10:00:00 +00:00
|
|
|
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Get up to num elements from the fifo. Return the number actully read
|
|
|
|
*/
|
2016-09-26 15:39:37 +00:00
|
|
|
static inline uint32_t
|
|
|
|
kni_fifo_get(struct rte_kni_fifo *fifo, void **data, uint32_t num)
|
2013-09-18 10:00:00 +00:00
|
|
|
{
|
2016-09-26 15:39:37 +00:00
|
|
|
uint32_t i = 0;
|
|
|
|
uint32_t new_read = fifo->read;
|
2018-10-08 09:11:45 +00:00
|
|
|
uint32_t fifo_write = smp_load_acquire(&fifo->write);
|
2013-09-18 10:00:00 +00:00
|
|
|
|
|
|
|
for (i = 0; i < num; i++) {
|
|
|
|
if (new_read == fifo_write)
|
|
|
|
break;
|
|
|
|
|
|
|
|
data[i] = fifo->buffer[new_read];
|
|
|
|
new_read = (new_read + 1) & (fifo->len - 1);
|
|
|
|
}
|
2018-10-08 09:11:45 +00:00
|
|
|
smp_store_release(&fifo->read, new_read);
|
2013-09-18 10:00:00 +00:00
|
|
|
|
|
|
|
return i;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Get the num of elements in the fifo
|
|
|
|
*/
|
2016-09-26 15:39:37 +00:00
|
|
|
static inline uint32_t
|
2013-09-18 10:00:00 +00:00
|
|
|
kni_fifo_count(struct rte_kni_fifo *fifo)
|
|
|
|
{
|
2018-10-08 09:11:45 +00:00
|
|
|
uint32_t fifo_write = smp_load_acquire(&fifo->write);
|
|
|
|
uint32_t fifo_read = smp_load_acquire(&fifo->read);
|
|
|
|
return (fifo->len + fifo_write - fifo_read) & (fifo->len - 1);
|
2013-09-18 10:00:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Get the num of available elements in the fifo
|
|
|
|
*/
|
2016-09-26 15:39:37 +00:00
|
|
|
static inline uint32_t
|
2013-09-18 10:00:00 +00:00
|
|
|
kni_fifo_free_count(struct rte_kni_fifo *fifo)
|
|
|
|
{
|
2018-10-08 09:11:45 +00:00
|
|
|
uint32_t fifo_write = smp_load_acquire(&fifo->write);
|
|
|
|
uint32_t fifo_read = smp_load_acquire(&fifo->read);
|
|
|
|
return (fifo_read - fifo_write - 1) & (fifo->len - 1);
|
2013-09-18 10:00:00 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#endif /* _KNI_FIFO_H_ */
|