espressif_tinyusb/src/common/tusb_fifo.h

163 lines
4.7 KiB
C
Raw Normal View History

2014-03-12 08:08:52 +01:00
/**************************************************************************/
/*!
@file tusb_fifo.h
2014-03-12 08:08:52 +01:00
@author hathach (tinyusb.org)
@section LICENSE
Software License Agreement (BSD License)
2018-02-28 09:23:41 +01:00
Copyright (c) 2018, hathach (tinyusb.org)
2014-03-12 08:08:52 +01:00
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holders nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ''AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
INCLUDING NEGLIGENCE OR OTHERWISE ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
This file is part of the tinyusb stack.
*/
/**************************************************************************/
/** \ingroup Group_Common
2014-03-24 06:35:44 +01:00
* \defgroup group_fifo fifo
* @{ */
2014-03-12 08:08:52 +01:00
#ifndef _TUSB_FIFO_H_
#define _TUSB_FIFO_H_
2018-02-28 09:23:41 +01:00
#define CFG_FIFO_MUTEX 0
#include <stdint.h>
#include <stdbool.h>
#include <string.h>
2014-03-12 08:08:52 +01:00
#ifdef __cplusplus
extern "C" {
#endif
2018-02-28 09:23:41 +01:00
#if CFG_FIFO_MUTEX
2018-04-09 19:09:24 +02:00
#include "osal/osal.h"
2018-02-28 09:23:41 +01:00
#if CFG_TUSB_OS == OPT_OS_NONE
2018-04-09 19:09:24 +02:00
// Since all fifo read/write is done in thread mode, there should be
// no conflict except for osal queue which will be address seperatedly.
// Therefore there may be no need for mutex with internal use of fifo
#define _ff_mutex_def(mutex)
#else
#define tu_fifo_mutex_t struct os_mutex
2018-02-28 09:23:41 +01:00
#define tu_fifo_mutex_lock(m) os_mutex_pend(m, OS_TIMEOUT_NEVER)
#define tu_fifo_mutex_unlock(m) os_mutex_release(m)
2018-02-28 09:23:41 +01:00
/* Internal use only */
#define _mutex_declare(m) .mutex = m
2018-04-09 19:09:24 +02:00
#endif
2018-02-28 09:23:41 +01:00
#else
#define _mutex_declare(m)
#endif
/** \struct tu_fifo_t
2014-03-12 08:08:52 +01:00
* \brief Simple Circular FIFO
*/
typedef struct
{
2018-02-28 10:45:54 +01:00
uint8_t* buffer ; ///< buffer pointer
uint16_t depth ; ///< max items
uint16_t item_size ; ///< size of each item
volatile uint16_t count ; ///< number of items in queue
volatile uint16_t wr_idx ; ///< write pointer
volatile uint16_t rd_idx ; ///< read pointer
bool overwritable ;
2018-02-28 09:23:41 +01:00
#if CFG_FIFO_MUTEX
tu_fifo_mutex_t * const mutex;
2018-02-28 09:23:41 +01:00
#endif
} tu_fifo_t;
2014-03-12 08:08:52 +01:00
#define TU_FIFO_DEF(_name, _depth, _type, _overwritable) /*, irq_mutex)*/ \
uint8_t _name##_buf[_depth*sizeof(_type)];\
tu_fifo_t _name = {\
.buffer = _name##_buf,\
.depth = _depth,\
.item_size = sizeof(_type),\
.overwritable = _overwritable,\
2014-03-12 08:08:52 +01:00
/*.irq = irq_mutex*/\
2018-02-28 09:23:41 +01:00
_mutex_declare(_mutex)\
2014-03-12 08:08:52 +01:00
}
void tu_fifo_clear(tu_fifo_t *f);
void tu_fifo_config(tu_fifo_t *f, void* buffer, uint16_t depth, uint16_t item_size, bool overwritable);
2014-03-12 08:08:52 +01:00
bool tu_fifo_write (tu_fifo_t* f, void const * p_data);
uint16_t tu_fifo_write_n (tu_fifo_t* f, void const * p_data, uint16_t count);
2018-02-28 09:23:41 +01:00
bool tu_fifo_read (tu_fifo_t* f, void * p_buffer);
uint16_t tu_fifo_read_n (tu_fifo_t* f, void * p_buffer, uint16_t count);
2018-02-28 09:23:41 +01:00
bool tu_fifo_peek_at (tu_fifo_t* f, uint16_t position, void * p_buffer);
2018-02-28 09:23:41 +01:00
static inline bool tu_fifo_peek(tu_fifo_t* f, void * p_buffer)
2018-02-28 09:23:41 +01:00
{
return tu_fifo_peek_at(f, 0, p_buffer);
2018-02-28 09:23:41 +01:00
}
static inline bool tu_fifo_empty(tu_fifo_t* f)
2014-03-12 08:08:52 +01:00
{
return (f->count == 0);
}
static inline bool tu_fifo_full(tu_fifo_t* f)
2014-03-12 08:08:52 +01:00
{
return (f->count == f->depth);
}
static inline uint16_t tu_fifo_count(tu_fifo_t* f)
2014-03-12 08:08:52 +01:00
{
return f->count;
}
static inline uint16_t tu_fifo_remaining(tu_fifo_t* f)
2018-02-28 09:23:41 +01:00
{
return f->depth - f->count;
}
static inline uint16_t tu_fifo_depth(tu_fifo_t* f)
2018-02-28 09:23:41 +01:00
{
return f->depth;
}
2014-03-12 08:08:52 +01:00
#ifdef __cplusplus
}
#endif
#endif /* _TUSB_FIFO_H_ */