2019-03-20 16:11:42 +07:00
|
|
|
/*
|
|
|
|
* The MIT License (MIT)
|
|
|
|
*
|
2019-05-14 11:48:05 +07:00
|
|
|
* Copyright (c) 2019 Ha Thach (tinyusb.org)
|
2019-03-20 16:11:42 +07:00
|
|
|
*
|
|
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
|
|
* in the Software without restriction, including without limitation the rights
|
|
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
|
|
* furnished to do so, subject to the following conditions:
|
|
|
|
*
|
|
|
|
* The above copyright notice and this permission notice shall be included in
|
|
|
|
* all copies or substantial portions of the Software.
|
|
|
|
*
|
|
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
|
|
* THE SOFTWARE.
|
|
|
|
*
|
|
|
|
* This file is part of the TinyUSB stack.
|
2018-09-26 01:39:59 +07:00
|
|
|
*/
|
2018-02-28 15:23:41 +07:00
|
|
|
|
2018-11-02 17:28:07 +07:00
|
|
|
#include <string.h>
|
|
|
|
|
|
|
|
#include "osal/osal.h"
|
2018-03-28 13:10:57 +07:00
|
|
|
#include "tusb_fifo.h"
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-11-02 17:28:07 +07:00
|
|
|
// implement mutex lock and unlock
|
2018-02-28 15:23:41 +07:00
|
|
|
#if CFG_FIFO_MUTEX
|
2014-03-14 14:33:50 +07:00
|
|
|
|
2018-11-13 15:34:50 +07:00
|
|
|
static void tu_fifo_lock(tu_fifo_t *f)
|
2018-11-02 17:28:07 +07:00
|
|
|
{
|
|
|
|
if (f->mutex)
|
|
|
|
{
|
2018-12-13 13:49:09 +07:00
|
|
|
osal_mutex_lock(f->mutex, OSAL_TIMEOUT_WAIT_FOREVER);
|
2018-11-02 17:28:07 +07:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void tu_fifo_unlock(tu_fifo_t *f)
|
|
|
|
{
|
|
|
|
if (f->mutex)
|
|
|
|
{
|
|
|
|
osal_mutex_unlock(f->mutex);
|
|
|
|
}
|
|
|
|
}
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
#else
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-11-13 15:34:50 +07:00
|
|
|
#define tu_fifo_lock(_ff)
|
2018-11-02 17:28:07 +07:00
|
|
|
#define tu_fifo_unlock(_ff)
|
2018-02-28 15:23:41 +07:00
|
|
|
|
|
|
|
#endif
|
|
|
|
|
2018-11-02 17:28:07 +07:00
|
|
|
bool tu_fifo_config(tu_fifo_t *f, void* buffer, uint16_t depth, uint16_t item_size, bool overwritable)
|
2018-03-08 11:42:28 +07:00
|
|
|
{
|
2018-11-13 15:34:50 +07:00
|
|
|
tu_fifo_lock(f);
|
2018-03-08 11:42:28 +07:00
|
|
|
|
|
|
|
f->buffer = (uint8_t*) buffer;
|
|
|
|
f->depth = depth;
|
|
|
|
f->item_size = item_size;
|
|
|
|
f->overwritable = overwritable;
|
|
|
|
|
|
|
|
f->rd_idx = f->wr_idx = f->count = 0;
|
|
|
|
|
2018-11-02 17:28:07 +07:00
|
|
|
tu_fifo_unlock(f);
|
|
|
|
|
|
|
|
return true;
|
2018-03-08 11:42:28 +07:00
|
|
|
}
|
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
// retrieve data from fifo
|
|
|
|
static void _tu_ff_pull(tu_fifo_t* f, void * buffer)
|
|
|
|
{
|
|
|
|
memcpy(buffer,
|
|
|
|
f->buffer + (f->rd_idx * f->item_size),
|
|
|
|
f->item_size);
|
|
|
|
|
|
|
|
f->rd_idx = (f->rd_idx + 1) % f->depth;
|
|
|
|
f->count--;
|
|
|
|
}
|
|
|
|
|
|
|
|
// send data to fifo
|
|
|
|
static void _tu_ff_push(tu_fifo_t* f, void const * data)
|
|
|
|
{
|
|
|
|
memcpy( f->buffer + (f->wr_idx * f->item_size),
|
|
|
|
data,
|
|
|
|
f->item_size);
|
|
|
|
|
|
|
|
f->wr_idx = (f->wr_idx + 1) % f->depth;
|
|
|
|
|
|
|
|
if (tu_fifo_full(f))
|
|
|
|
{
|
|
|
|
f->rd_idx = f->wr_idx; // keep the full state (rd == wr && len = size)
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
f->count++;
|
|
|
|
}
|
|
|
|
}
|
2018-03-08 11:42:28 +07:00
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
/******************************************************************************/
|
2014-03-12 14:08:52 +07:00
|
|
|
/*!
|
|
|
|
@brief Read one byte out of the RX buffer.
|
|
|
|
|
|
|
|
This function will return the byte located at the array index of the
|
|
|
|
read pointer, and then increment the read pointer index. If the read
|
|
|
|
pointer exceeds the maximum buffer size, it will roll over to zero.
|
|
|
|
|
|
|
|
@param[in] f
|
|
|
|
Pointer to the FIFO buffer to manipulate
|
2019-05-29 16:55:15 +07:00
|
|
|
@param[in] buffer
|
2014-03-12 14:08:52 +07:00
|
|
|
Pointer to the place holder for data read from the buffer
|
|
|
|
|
|
|
|
@returns TRUE if the queue is not empty
|
|
|
|
*/
|
2018-02-28 15:23:41 +07:00
|
|
|
/******************************************************************************/
|
2019-05-29 16:55:15 +07:00
|
|
|
bool tu_fifo_read(tu_fifo_t* f, void * buffer)
|
2014-03-12 14:08:52 +07:00
|
|
|
{
|
2018-07-04 00:22:15 +07:00
|
|
|
if( tu_fifo_empty(f) ) return false;
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-11-13 15:34:50 +07:00
|
|
|
tu_fifo_lock(f);
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
_tu_ff_pull(f, buffer);
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-11-02 17:28:07 +07:00
|
|
|
tu_fifo_unlock(f);
|
2014-03-12 14:08:52 +07:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
/******************************************************************************/
|
|
|
|
/*!
|
|
|
|
@brief This function will read n elements into the array index specified by
|
|
|
|
the write pointer and increment the write index. If the write index
|
|
|
|
exceeds the max buffer size, then it will roll over to zero.
|
|
|
|
|
|
|
|
@param[in] f
|
|
|
|
Pointer to the FIFO buffer to manipulate
|
2019-05-29 16:55:15 +07:00
|
|
|
@param[in] buffer
|
2018-02-28 15:23:41 +07:00
|
|
|
The pointer to data location
|
|
|
|
@param[in] count
|
|
|
|
Number of element that buffer can afford
|
|
|
|
|
2018-03-08 14:02:53 +07:00
|
|
|
@returns number of items read from the FIFO
|
2018-02-28 15:23:41 +07:00
|
|
|
*/
|
|
|
|
/******************************************************************************/
|
2019-05-29 16:55:15 +07:00
|
|
|
uint16_t tu_fifo_read_n (tu_fifo_t* f, void * buffer, uint16_t count)
|
2018-02-28 15:23:41 +07:00
|
|
|
{
|
2018-07-04 00:22:15 +07:00
|
|
|
if( tu_fifo_empty(f) ) return 0;
|
2018-02-28 15:23:41 +07:00
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
tu_fifo_lock(f);
|
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
/* Limit up to fifo's count */
|
2018-09-26 01:39:59 +07:00
|
|
|
if ( count > f->count ) count = f->count;
|
2018-02-28 15:23:41 +07:00
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
uint8_t* buf8 = (uint8_t*) buffer;
|
2018-02-28 15:23:41 +07:00
|
|
|
uint16_t len = 0;
|
2019-05-29 16:55:15 +07:00
|
|
|
|
|
|
|
while (len < count)
|
2018-02-28 15:23:41 +07:00
|
|
|
{
|
2019-05-29 16:55:15 +07:00
|
|
|
_tu_ff_pull(f, buf8);
|
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
len++;
|
2019-05-29 16:55:15 +07:00
|
|
|
buf8 += f->item_size;
|
2018-02-28 15:23:41 +07:00
|
|
|
}
|
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
tu_fifo_unlock(f);
|
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
return len;
|
|
|
|
}
|
|
|
|
|
|
|
|
/******************************************************************************/
|
|
|
|
/*!
|
|
|
|
@brief Reads one item without removing it from the FIFO
|
|
|
|
|
|
|
|
@param[in] f
|
|
|
|
Pointer to the FIFO buffer to manipulate
|
2018-07-14 23:28:07 +07:00
|
|
|
@param[in] pos
|
2018-02-28 15:23:41 +07:00
|
|
|
Position to read from in the FIFO buffer
|
|
|
|
@param[in] p_buffer
|
|
|
|
Pointer to the place holder for data read from the buffer
|
|
|
|
|
|
|
|
@returns TRUE if the queue is not empty
|
|
|
|
*/
|
|
|
|
/******************************************************************************/
|
2018-07-14 23:28:07 +07:00
|
|
|
bool tu_fifo_peek_at(tu_fifo_t* f, uint16_t pos, void * p_buffer)
|
2018-02-28 15:23:41 +07:00
|
|
|
{
|
2018-07-14 23:28:07 +07:00
|
|
|
if ( pos >= f->count ) return false;
|
2018-02-28 15:23:41 +07:00
|
|
|
|
2018-07-14 23:28:07 +07:00
|
|
|
// rd_idx is pos=0
|
|
|
|
uint16_t index = (f->rd_idx + pos) % f->depth;
|
2018-02-28 15:23:41 +07:00
|
|
|
memcpy(p_buffer,
|
|
|
|
f->buffer + (index * f->item_size),
|
|
|
|
f->item_size);
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
/******************************************************************************/
|
2014-03-12 14:08:52 +07:00
|
|
|
/*!
|
2018-02-28 15:23:41 +07:00
|
|
|
@brief Write one element into the RX buffer.
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
This function will write one element into the array index specified by
|
2014-03-12 14:08:52 +07:00
|
|
|
the write pointer and increment the write index. If the write index
|
|
|
|
exceeds the max buffer size, then it will roll over to zero.
|
|
|
|
|
|
|
|
@param[in] f
|
|
|
|
Pointer to the FIFO buffer to manipulate
|
2019-05-29 16:55:15 +07:00
|
|
|
@param[in] data
|
2014-03-12 14:08:52 +07:00
|
|
|
The byte to add to the FIFO
|
|
|
|
|
|
|
|
@returns TRUE if the data was written to the FIFO (overwrittable
|
|
|
|
FIFO will always return TRUE)
|
|
|
|
*/
|
2018-02-28 15:23:41 +07:00
|
|
|
/******************************************************************************/
|
2019-05-29 16:55:15 +07:00
|
|
|
bool tu_fifo_write (tu_fifo_t* f, const void * data)
|
2014-03-12 14:08:52 +07:00
|
|
|
{
|
2018-11-02 17:28:07 +07:00
|
|
|
if ( tu_fifo_full(f) && !f->overwritable ) return false;
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-11-13 15:34:50 +07:00
|
|
|
tu_fifo_lock(f);
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
_tu_ff_push(f, data);
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-11-02 17:28:07 +07:00
|
|
|
tu_fifo_unlock(f);
|
2014-03-12 14:08:52 +07:00
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
/******************************************************************************/
|
2014-03-12 14:08:52 +07:00
|
|
|
/*!
|
2018-02-28 15:23:41 +07:00
|
|
|
@brief This function will write n elements into the array index specified by
|
|
|
|
the write pointer and increment the write index. If the write index
|
|
|
|
exceeds the max buffer size, then it will roll over to zero.
|
2014-03-12 14:08:52 +07:00
|
|
|
|
|
|
|
@param[in] f
|
|
|
|
Pointer to the FIFO buffer to manipulate
|
2019-05-29 16:55:15 +07:00
|
|
|
@param[in] data
|
2018-02-28 15:23:41 +07:00
|
|
|
The pointer to data to add to the FIFO
|
|
|
|
@param[in] count
|
|
|
|
Number of element
|
|
|
|
@return Number of written elements
|
2014-03-12 14:08:52 +07:00
|
|
|
*/
|
2018-02-28 15:23:41 +07:00
|
|
|
/******************************************************************************/
|
2019-05-29 16:55:15 +07:00
|
|
|
uint16_t tu_fifo_write_n (tu_fifo_t* f, const void * data, uint16_t count)
|
2014-03-12 14:08:52 +07:00
|
|
|
{
|
2018-02-28 15:23:41 +07:00
|
|
|
if ( count == 0 ) return 0;
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
tu_fifo_lock(f);
|
|
|
|
|
|
|
|
// Not overwritable limit up to full
|
|
|
|
if (!f->overwritable) count = tu_min16(count, tu_fifo_remaining(f));
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
uint8_t const* buf8 = (uint8_t const*) data;
|
2018-02-28 15:23:41 +07:00
|
|
|
uint16_t len = 0;
|
2019-05-29 16:55:15 +07:00
|
|
|
|
|
|
|
while (len < count)
|
2018-02-28 15:23:41 +07:00
|
|
|
{
|
2019-05-29 16:55:15 +07:00
|
|
|
_tu_ff_push(f, buf8);
|
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
len++;
|
2019-05-29 16:55:15 +07:00
|
|
|
buf8 += f->item_size;
|
2018-02-28 15:23:41 +07:00
|
|
|
}
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2019-05-29 16:55:15 +07:00
|
|
|
tu_fifo_unlock(f);
|
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
return len;
|
|
|
|
}
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
/******************************************************************************/
|
2014-03-12 14:08:52 +07:00
|
|
|
/*!
|
2018-02-28 15:23:41 +07:00
|
|
|
@brief Clear the fifo read and write pointers and set length to zero
|
2014-03-12 14:08:52 +07:00
|
|
|
|
|
|
|
@param[in] f
|
2018-02-28 15:23:41 +07:00
|
|
|
Pointer to the FIFO buffer to manipulate
|
2014-03-12 14:08:52 +07:00
|
|
|
*/
|
2018-02-28 15:23:41 +07:00
|
|
|
/******************************************************************************/
|
2018-11-02 17:28:07 +07:00
|
|
|
bool tu_fifo_clear(tu_fifo_t *f)
|
2018-02-28 15:23:41 +07:00
|
|
|
{
|
2018-11-13 15:34:50 +07:00
|
|
|
tu_fifo_lock(f);
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-02-28 15:23:41 +07:00
|
|
|
f->rd_idx = f->wr_idx = f->count = 0;
|
2014-03-12 14:08:52 +07:00
|
|
|
|
2018-11-02 17:28:07 +07:00
|
|
|
tu_fifo_unlock(f);
|
|
|
|
|
|
|
|
return true;
|
2014-03-12 14:08:52 +07:00
|
|
|
}
|