2015-12-17 16:11:31 +00:00
|
|
|
/*
|
|
|
|
ChibiOS - Copyright (C) 2006..2015 Giovanni Di Sirio
|
|
|
|
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
you may not use this file except in compliance with the License.
|
|
|
|
You may obtain a copy of the License at
|
|
|
|
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
See the License for the specific language governing permissions and
|
|
|
|
limitations under the License.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @file hal_buffers.h
|
|
|
|
* @brief I/O Buffers macros and structures.
|
|
|
|
*
|
|
|
|
* @addtogroup HAL_BUFFERS
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _HAL_BUFFERS_H_
|
|
|
|
#define _HAL_BUFFERS_H_
|
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Driver constants. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Driver pre-compile time settings. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Derived constants and error checks. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Driver data structures and types. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
/**
|
2015-12-20 09:45:43 +00:00
|
|
|
* @brief Type of a generic queue of buffers.
|
2015-12-17 16:11:31 +00:00
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
typedef struct io_buffers_queue io_buffers_queue_t;
|
2015-12-17 16:11:31 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Double buffer notification callback type.
|
|
|
|
*
|
2015-12-20 09:45:43 +00:00
|
|
|
* @param[in] iodbp the buffers queue pointer
|
2015-12-17 16:11:31 +00:00
|
|
|
*/
|
2015-12-21 16:49:54 +00:00
|
|
|
typedef void (*bqnotify_t)(io_buffers_queue_t *bqp);
|
2015-12-17 16:11:31 +00:00
|
|
|
|
|
|
|
/**
|
2015-12-20 09:45:43 +00:00
|
|
|
* @brief Structure of a generic buffers queue.
|
2015-12-17 16:11:31 +00:00
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
struct io_buffers_queue {
|
2015-12-17 16:11:31 +00:00
|
|
|
/**
|
|
|
|
* @brief Queue of waiting threads.
|
|
|
|
*/
|
|
|
|
threads_queue_t waiting;
|
|
|
|
/**
|
|
|
|
* @brief Active buffers counter.
|
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
volatile size_t bcounter;
|
2015-12-17 16:11:31 +00:00
|
|
|
/**
|
|
|
|
* @brief Buffer write pointer.
|
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
uint8_t *bwrptr;
|
2015-12-17 16:11:31 +00:00
|
|
|
/**
|
|
|
|
* @brief Buffer read pointer.
|
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
uint8_t *brdptr;
|
2015-12-17 16:11:31 +00:00
|
|
|
/**
|
2015-12-20 09:45:43 +00:00
|
|
|
* @brief Pointer to the buffers boundary.
|
2015-12-17 16:11:31 +00:00
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
uint8_t *btop;
|
|
|
|
/**
|
|
|
|
* @brief Size of buffers.
|
|
|
|
* @note The buffer size must be not lower than <tt>sizeof(size_t) + 2</tt>
|
|
|
|
* because the first bytes are used to store the used size of the
|
|
|
|
* buffer.
|
|
|
|
*/
|
|
|
|
size_t bsize;
|
|
|
|
/**
|
|
|
|
* @brief Number of buffers.
|
|
|
|
*/
|
|
|
|
size_t bn;
|
2015-12-17 16:11:31 +00:00
|
|
|
/**
|
|
|
|
* @brief Queue of buffer objects.
|
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
uint8_t *buffers;
|
|
|
|
/**
|
|
|
|
* @brief Pointer for R/W sequential access.
|
2015-12-20 10:25:41 +00:00
|
|
|
* @note It is @p NULL if a new buffer must be fetched from the queue.
|
2015-12-20 09:45:43 +00:00
|
|
|
*/
|
|
|
|
uint8_t *ptr;
|
2015-12-20 10:25:41 +00:00
|
|
|
/**
|
|
|
|
* @brief Boundary for R/W sequential access.
|
|
|
|
*/
|
|
|
|
uint8_t *top;
|
2015-12-17 16:11:31 +00:00
|
|
|
/**
|
|
|
|
* @brief Data notification callback.
|
|
|
|
*/
|
2015-12-21 16:49:54 +00:00
|
|
|
bqnotify_t notify;
|
2015-12-17 16:11:31 +00:00
|
|
|
/**
|
|
|
|
* @brief Application defined field.
|
|
|
|
*/
|
|
|
|
void *link;
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
2015-12-20 09:45:43 +00:00
|
|
|
* @brief Type of an input buffers queue.
|
2015-12-17 16:11:31 +00:00
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
typedef io_buffers_queue_t input_buffers_queue_t;
|
2015-12-17 16:11:31 +00:00
|
|
|
|
|
|
|
/**
|
2015-12-20 09:45:43 +00:00
|
|
|
* @brief Type of an output buffers queue.
|
2015-12-17 16:11:31 +00:00
|
|
|
*/
|
2015-12-20 09:45:43 +00:00
|
|
|
typedef io_buffers_queue_t output_buffers_queue_t;
|
2015-12-17 16:11:31 +00:00
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Driver macros. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
2015-12-21 11:20:33 +00:00
|
|
|
/**
|
|
|
|
* @brief Computes the size of a buffers queue buffer size.
|
|
|
|
*
|
2016-01-03 14:33:37 +00:00
|
|
|
* @param[in] n number of buffers in the queue
|
2015-12-21 11:20:33 +00:00
|
|
|
* @param[in] size size of the buffers
|
|
|
|
*/
|
|
|
|
#define BQ_BUFFER_SIZE(n, size) \
|
2016-01-13 07:14:39 +00:00
|
|
|
(((size_t)(size) + sizeof (size_t)) * (size_t)(n))
|
2015-12-21 11:20:33 +00:00
|
|
|
|
2015-12-20 09:45:43 +00:00
|
|
|
/**
|
|
|
|
* @name Macro Functions
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
/**
|
|
|
|
* @brief Returns the queue's number of buffers.
|
|
|
|
*
|
|
|
|
* @param[in] bqp pointer to an @p io_buffers_queue_t structure
|
|
|
|
* @return The number of buffers.
|
|
|
|
*
|
|
|
|
* @xclass
|
|
|
|
*/
|
|
|
|
#define bqSizeX(bqp) ((bqp)->bn)
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Return the ready buffers number.
|
|
|
|
* @details Returns the number of filled buffers if used on an input queue
|
|
|
|
* or the number of empty buffers if used on an output queue.
|
|
|
|
*
|
|
|
|
* @param[in] bqp pointer to an @p io_buffers_queue_t structure
|
|
|
|
* @return The number of ready buffers.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
|
|
|
#define bqSpaceI(bqp) ((bqp)->bcounter)
|
|
|
|
|
2015-12-21 11:20:33 +00:00
|
|
|
/**
|
|
|
|
* @brief Returns the queue application-defined link.
|
|
|
|
*
|
|
|
|
* @param[in] bqp pointer to an @p io_buffers_queue_t structure
|
|
|
|
* @return The application-defined link.
|
|
|
|
*
|
|
|
|
* @special
|
|
|
|
*/
|
|
|
|
#define bqGetLinkX(bqp) ((bqp)->link)
|
|
|
|
|
2015-12-20 09:45:43 +00:00
|
|
|
/**
|
2015-12-21 16:49:54 +00:00
|
|
|
* @brief Evaluates to @p TRUE if the specified input buffers queue is empty.
|
2015-12-20 09:45:43 +00:00
|
|
|
*
|
|
|
|
* @param[in] ibqp pointer to an @p input_buffers_queue_t structure
|
|
|
|
* @return The queue status.
|
|
|
|
* @retval false if the queue is not empty.
|
|
|
|
* @retval true if the queue is empty.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2015-12-20 10:25:41 +00:00
|
|
|
#define ibqIsEmptyI(ibqp) ((bool)(bqSpaceI(ibqp) == 0U))
|
2015-12-20 09:45:43 +00:00
|
|
|
|
|
|
|
/**
|
2015-12-21 16:49:54 +00:00
|
|
|
* @brief Evaluates to @p TRUE if the specified input buffers queue is full.
|
2015-12-20 09:45:43 +00:00
|
|
|
*
|
|
|
|
* @param[in] ibqp pointer to an @p input_buffers_queue_t structure
|
|
|
|
* @return The queue status.
|
|
|
|
* @retval false if the queue is not full.
|
|
|
|
* @retval true if the queue is full.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2016-01-04 15:11:17 +00:00
|
|
|
#define ibqIsFullI(ibqp) \
|
|
|
|
/*lint -save -e9007 [13.5] No side effects, a pointer is passed.*/ \
|
|
|
|
((bool)(((ibqp)->bwrptr == (ibqp)->brdptr) && ((ibqp)->bcounter != 0U))) \
|
|
|
|
/*lint -restore*/
|
2015-12-21 16:49:54 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Evaluates to @p true if the specified output buffers queue is empty.
|
|
|
|
*
|
|
|
|
* @param[in] obqp pointer to an @p output_buffers_queue_t structure
|
|
|
|
* @return The queue status.
|
|
|
|
* @retval false if the queue is not empty.
|
|
|
|
* @retval true if the queue is empty.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2016-01-04 15:11:17 +00:00
|
|
|
#define obqIsEmptyI(obqp) \
|
|
|
|
/*lint -save -e9007 [13.5] No side effects, a pointer is passed.*/ \
|
|
|
|
((bool)(((obqp)->bwrptr == (obqp)->brdptr) && ((obqp)->bcounter != 0U))) \
|
|
|
|
/*lint -restore*/
|
2015-12-21 16:49:54 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Evaluates to @p true if the specified output buffers queue is full.
|
|
|
|
*
|
|
|
|
* @param[in] obqp pointer to an @p output_buffers_queue_t structure
|
|
|
|
* @return The queue status.
|
|
|
|
* @retval false if the queue is not full.
|
|
|
|
* @retval true if the queue is full.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
|
|
|
#define obqIsFullI(obqp) ((bool)(bqSpaceI(obqp) == 0U))
|
2015-12-20 09:45:43 +00:00
|
|
|
/** @} */
|
|
|
|
|
2015-12-17 16:11:31 +00:00
|
|
|
/*===========================================================================*/
|
|
|
|
/* External declarations. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
2016-01-04 15:11:17 +00:00
|
|
|
void ibqObjectInit(input_buffers_queue_t *ibqp, uint8_t *bp,
|
2015-12-20 09:45:43 +00:00
|
|
|
size_t size, size_t n,
|
2015-12-21 16:49:54 +00:00
|
|
|
bqnotify_t infy, void *link);
|
2015-12-21 11:20:33 +00:00
|
|
|
void ibqResetI(input_buffers_queue_t *ibqp);
|
2015-12-20 11:38:54 +00:00
|
|
|
uint8_t *ibqGetEmptyBufferI(input_buffers_queue_t *ibqp);
|
2015-12-21 16:49:54 +00:00
|
|
|
void ibqPostFullBufferI(input_buffers_queue_t *ibqp, size_t size);
|
2015-12-23 09:08:01 +00:00
|
|
|
msg_t ibqGetFullBufferTimeout(input_buffers_queue_t *ibqp,
|
|
|
|
systime_t timeout);
|
2015-12-24 09:10:49 +00:00
|
|
|
msg_t ibqGetFullBufferTimeoutS(input_buffers_queue_t *ibqp,
|
|
|
|
systime_t timeout);
|
2015-12-23 09:08:01 +00:00
|
|
|
void ibqReleaseEmptyBuffer(input_buffers_queue_t *ibqp);
|
2015-12-24 09:10:49 +00:00
|
|
|
void ibqReleaseEmptyBufferS(input_buffers_queue_t *ibqp);
|
2015-12-20 11:38:54 +00:00
|
|
|
msg_t ibqGetTimeout(input_buffers_queue_t *ibqp, systime_t timeout);
|
|
|
|
size_t ibqReadTimeout(input_buffers_queue_t *ibqp, uint8_t *bp,
|
|
|
|
size_t n, systime_t timeout);
|
2015-12-21 16:49:54 +00:00
|
|
|
void obqObjectInit(output_buffers_queue_t *obqp, uint8_t *bp,
|
|
|
|
size_t size, size_t n,
|
|
|
|
bqnotify_t onfy, void *link);
|
|
|
|
void obqResetI(output_buffers_queue_t *obqp);
|
|
|
|
uint8_t *obqGetFullBufferI(output_buffers_queue_t *obqp,
|
|
|
|
size_t *sizep);
|
|
|
|
void obqReleaseEmptyBufferI(output_buffers_queue_t *obqp);
|
2015-12-23 09:08:01 +00:00
|
|
|
msg_t obqGetEmptyBufferTimeout(output_buffers_queue_t *obqp,
|
|
|
|
systime_t timeout);
|
2015-12-24 09:10:49 +00:00
|
|
|
msg_t obqGetEmptyBufferTimeoutS(output_buffers_queue_t *obqp,
|
|
|
|
systime_t timeout);
|
2015-12-23 09:08:01 +00:00
|
|
|
void obqPostFullBuffer(output_buffers_queue_t *obqp, size_t size);
|
2015-12-24 09:10:49 +00:00
|
|
|
void obqPostFullBufferS(output_buffers_queue_t *obqp, size_t size);
|
2015-12-21 16:49:54 +00:00
|
|
|
msg_t obqPutTimeout(output_buffers_queue_t *obqp, uint8_t b,
|
|
|
|
systime_t timeout);
|
|
|
|
size_t obqWriteTimeout(output_buffers_queue_t *obqp, const uint8_t *bp,
|
|
|
|
size_t n, systime_t timeout);
|
2015-12-22 16:12:32 +00:00
|
|
|
bool obqTryFlushI(output_buffers_queue_t *obqp);
|
|
|
|
void obqFlush(output_buffers_queue_t *obqp);
|
2015-12-17 16:11:31 +00:00
|
|
|
#ifdef __cplusplus
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#endif /* _HAL_BUFFERS_H_ */
|
|
|
|
|
|
|
|
/** @} */
|