2010-02-21 07:24:53 +00:00
|
|
|
/*
|
2015-01-11 13:45:54 +00:00
|
|
|
ChibiOS - Copyright (C) 2006..2015 Giovanni Di Sirio.
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2015-01-11 13:45:54 +00:00
|
|
|
This file is part of ChibiOS.
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2015-01-11 13:45:54 +00:00
|
|
|
ChibiOS is free software; you can redistribute it and/or modify
|
2010-02-21 07:24:53 +00:00
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation; either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
2015-01-11 13:45:54 +00:00
|
|
|
ChibiOS is distributed in the hope that it will be useful,
|
2010-02-21 07:24:53 +00:00
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
2011-01-01 10:38:05 +00:00
|
|
|
* @file chqueues.h
|
|
|
|
* @brief I/O Queues macros and structures.
|
2010-02-21 07:24:53 +00:00
|
|
|
*
|
|
|
|
* @addtogroup io_queues
|
|
|
|
* @{
|
|
|
|
*/
|
|
|
|
|
2010-02-27 08:54:22 +00:00
|
|
|
#ifndef _CHQUEUES_H_
|
|
|
|
#define _CHQUEUES_H_
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2015-03-05 21:28:51 +00:00
|
|
|
#if (CH_CFG_USE_QUEUES == TRUE) || defined(__DOXYGEN__)
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2013-08-09 13:43:56 +00:00
|
|
|
/*===========================================================================*/
|
|
|
|
/* Module constants. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
2011-08-22 17:18:52 +00:00
|
|
|
/**
|
|
|
|
* @name Queue functions returned status value
|
|
|
|
* @{
|
|
|
|
*/
|
2013-08-17 11:52:50 +00:00
|
|
|
#define Q_OK MSG_OK /**< @brief Operation successful. */
|
|
|
|
#define Q_TIMEOUT MSG_TIMEOUT /**< @brief Timeout condition. */
|
|
|
|
#define Q_RESET MSG_RESET /**< @brief Queue has been reset. */
|
2011-08-22 17:18:52 +00:00
|
|
|
#define Q_EMPTY -3 /**< @brief Queue empty. */
|
|
|
|
#define Q_FULL -4 /**< @brief Queue full, */
|
|
|
|
/** @} */
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2013-08-09 13:43:56 +00:00
|
|
|
/*===========================================================================*/
|
|
|
|
/* Module pre-compile time settings. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Derived constants and error checks. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Module data structures and types. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
2010-02-21 07:24:53 +00:00
|
|
|
/**
|
2011-01-01 11:48:59 +00:00
|
|
|
* @brief Type of a generic I/O queue structure.
|
2011-01-02 14:01:18 +00:00
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
typedef struct io_queue io_queue_t;
|
2011-01-02 14:01:18 +00:00
|
|
|
|
|
|
|
/** @brief Queue notification callback type.*/
|
2013-08-09 13:43:56 +00:00
|
|
|
typedef void (*qnotify_t)(io_queue_t *qp);
|
2011-01-02 14:01:18 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Generic I/O queue structure.
|
2010-02-21 07:24:53 +00:00
|
|
|
* @details This structure represents a generic Input or Output asymmetrical
|
|
|
|
* queue. The queue is asymmetrical because one end is meant to be
|
|
|
|
* accessed from a thread context, and thus can be blocking, the other
|
|
|
|
* end is accessible from interrupt handlers or from within a kernel
|
|
|
|
* lock zone (see <b>I-Locked</b> and <b>S-Locked</b> states in
|
|
|
|
* @ref system_states) and is non-blocking.
|
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
struct io_queue {
|
2013-07-19 09:43:11 +00:00
|
|
|
threads_queue_t q_waiting; /**< @brief Queue of waiting threads. */
|
2011-05-18 17:54:55 +00:00
|
|
|
size_t q_counter; /**< @brief Resources counter. */
|
2010-02-21 07:24:53 +00:00
|
|
|
uint8_t *q_buffer; /**< @brief Pointer to the queue buffer.*/
|
|
|
|
uint8_t *q_top; /**< @brief Pointer to the first location
|
|
|
|
after the buffer. */
|
|
|
|
uint8_t *q_wrptr; /**< @brief Write pointer. */
|
|
|
|
uint8_t *q_rdptr; /**< @brief Read pointer. */
|
|
|
|
qnotify_t q_notify; /**< @brief Data notification callback. */
|
2012-06-11 16:54:35 +00:00
|
|
|
void *q_link; /**< @brief Application defined field. */
|
2011-01-02 14:01:18 +00:00
|
|
|
};
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2013-08-09 13:43:56 +00:00
|
|
|
/**
|
|
|
|
* @extends io_queue_t
|
|
|
|
*
|
|
|
|
* @brief Type of an input queue structure.
|
|
|
|
* @details This structure represents a generic asymmetrical input queue.
|
|
|
|
* Writing to the queue is non-blocking and can be performed from
|
|
|
|
* interrupt handlers or from within a kernel lock zone (see
|
|
|
|
* <b>I-Locked</b> and <b>S-Locked</b> states in @ref system_states).
|
|
|
|
* Reading the queue can be a blocking operation and is supposed to
|
|
|
|
* be performed by a system thread.
|
|
|
|
*/
|
|
|
|
typedef io_queue_t input_queue_t;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @extends io_queue_t
|
|
|
|
*
|
|
|
|
* @brief Type of an output queue structure.
|
|
|
|
* @details This structure represents a generic asymmetrical output queue.
|
|
|
|
* Reading from the queue is non-blocking and can be performed from
|
|
|
|
* interrupt handlers or from within a kernel lock zone (see
|
|
|
|
* <b>I-Locked</b> and <b>S-Locked</b> states in @ref system_states).
|
|
|
|
* Writing the queue can be a blocking operation and is supposed to
|
|
|
|
* be performed by a system thread.
|
|
|
|
*/
|
|
|
|
typedef io_queue_t output_queue_t;
|
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Module macros. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Data part of a static input queue initializer.
|
|
|
|
* @details This macro should be used when statically initializing an
|
|
|
|
* input queue that is part of a bigger structure.
|
|
|
|
*
|
|
|
|
* @param[in] name the name of the input queue variable
|
|
|
|
* @param[in] buffer pointer to the queue buffer area
|
|
|
|
* @param[in] size size of the queue buffer area
|
|
|
|
* @param[in] inotify input notification callback pointer
|
|
|
|
* @param[in] link application defined pointer
|
|
|
|
*/
|
|
|
|
#define _INPUTQUEUE_DATA(name, buffer, size, inotify, link) { \
|
2014-09-10 12:35:59 +00:00
|
|
|
_THREADS_QUEUE_DATA(name), \
|
2013-08-09 13:43:56 +00:00
|
|
|
0, \
|
|
|
|
(uint8_t *)(buffer), \
|
|
|
|
(uint8_t *)(buffer) + (size), \
|
|
|
|
(uint8_t *)(buffer), \
|
|
|
|
(uint8_t *)(buffer), \
|
|
|
|
(inotify), \
|
|
|
|
(link) \
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Static input queue initializer.
|
|
|
|
* @details Statically initialized input queues require no explicit
|
|
|
|
* initialization using @p chIQInit().
|
|
|
|
*
|
|
|
|
* @param[in] name the name of the input queue variable
|
|
|
|
* @param[in] buffer pointer to the queue buffer area
|
|
|
|
* @param[in] size size of the queue buffer area
|
|
|
|
* @param[in] inotify input notification callback pointer
|
|
|
|
* @param[in] link application defined pointer
|
|
|
|
*/
|
|
|
|
#define INPUTQUEUE_DECL(name, buffer, size, inotify, link) \
|
|
|
|
input_queue_t name = _INPUTQUEUE_DATA(name, buffer, size, inotify, link)
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Data part of a static output queue initializer.
|
|
|
|
* @details This macro should be used when statically initializing an
|
|
|
|
* output queue that is part of a bigger structure.
|
|
|
|
*
|
|
|
|
* @param[in] name the name of the output queue variable
|
|
|
|
* @param[in] buffer pointer to the queue buffer area
|
|
|
|
* @param[in] size size of the queue buffer area
|
|
|
|
* @param[in] onotify output notification callback pointer
|
|
|
|
* @param[in] link application defined pointer
|
|
|
|
*/
|
|
|
|
#define _OUTPUTQUEUE_DATA(name, buffer, size, onotify, link) { \
|
2014-09-10 12:35:59 +00:00
|
|
|
_THREADS_QUEUE_DATA(name), \
|
2013-08-09 13:43:56 +00:00
|
|
|
(size), \
|
|
|
|
(uint8_t *)(buffer), \
|
|
|
|
(uint8_t *)(buffer) + (size), \
|
|
|
|
(uint8_t *)(buffer), \
|
|
|
|
(uint8_t *)(buffer), \
|
|
|
|
(onotify), \
|
|
|
|
(link) \
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Static output queue initializer.
|
|
|
|
* @details Statically initialized output queues require no explicit
|
|
|
|
* initialization using @p chOQInit().
|
|
|
|
*
|
|
|
|
* @param[in] name the name of the output queue variable
|
|
|
|
* @param[in] buffer pointer to the queue buffer area
|
|
|
|
* @param[in] size size of the queue buffer area
|
|
|
|
* @param[in] onotify output notification callback pointer
|
|
|
|
* @param[in] link application defined pointer
|
|
|
|
*/
|
|
|
|
#define OUTPUTQUEUE_DECL(name, buffer, size, onotify, link) \
|
|
|
|
output_queue_t name = _OUTPUTQUEUE_DATA(name, buffer, size, onotify, link)
|
|
|
|
|
2011-08-23 10:09:08 +00:00
|
|
|
/**
|
|
|
|
* @name Macro Functions
|
|
|
|
* @{
|
|
|
|
*/
|
2010-02-21 07:24:53 +00:00
|
|
|
/**
|
|
|
|
* @brief Returns the queue's buffer size.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] qp pointer to a @p io_queue_t structure.
|
2011-01-01 11:48:59 +00:00
|
|
|
* @return The buffer size.
|
|
|
|
*
|
2015-03-06 10:13:59 +00:00
|
|
|
* @xclass
|
2010-02-21 07:24:53 +00:00
|
|
|
*/
|
2015-03-06 10:13:59 +00:00
|
|
|
#define chQSizeX(qp) \
|
|
|
|
/*lint -save -e946 -e947 -e9033 [18.2, 18.3, 10.8] Perfectly safe.*/ \
|
|
|
|
((size_t)((qp)->q_top - (qp)->q_buffer)) \
|
|
|
|
/*lint -restore*/
|
2010-02-21 07:24:53 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Queue space.
|
2011-01-01 11:48:59 +00:00
|
|
|
* @details Returns the used space if used on an input queue or the empty
|
|
|
|
* space if used on an output queue.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] qp pointer to a @p io_queue_t structure.
|
2011-01-01 11:48:59 +00:00
|
|
|
* @return The buffer space.
|
|
|
|
*
|
2010-09-21 10:22:06 +00:00
|
|
|
* @iclass
|
2010-02-21 07:24:53 +00:00
|
|
|
*/
|
2011-08-23 10:09:08 +00:00
|
|
|
#define chQSpaceI(qp) ((qp)->q_counter)
|
2012-06-11 16:54:35 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Returns the queue application-defined link.
|
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] qp pointer to a @p io_queue_t structure.
|
2012-06-11 16:54:35 +00:00
|
|
|
* @return The application-defined link.
|
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @xclass
|
2012-06-11 16:54:35 +00:00
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
#define chQGetLinkX(qp) ((qp)->q_link)
|
2011-08-23 10:09:08 +00:00
|
|
|
/** @} */
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2013-08-09 13:43:56 +00:00
|
|
|
/*===========================================================================*/
|
|
|
|
/* External declarations. */
|
|
|
|
/*===========================================================================*/
|
|
|
|
|
|
|
|
#ifdef __cplusplus
|
|
|
|
extern "C" {
|
|
|
|
#endif
|
|
|
|
void chIQObjectInit(input_queue_t *iqp, uint8_t *bp, size_t size,
|
|
|
|
qnotify_t infy, void *link);
|
|
|
|
void chIQResetI(input_queue_t *iqp);
|
|
|
|
msg_t chIQPutI(input_queue_t *iqp, uint8_t b);
|
|
|
|
msg_t chIQGetTimeout(input_queue_t *iqp, systime_t time);
|
|
|
|
size_t chIQReadTimeout(input_queue_t *iqp, uint8_t *bp,
|
|
|
|
size_t n, systime_t time);
|
|
|
|
|
|
|
|
void chOQObjectInit(output_queue_t *oqp, uint8_t *bp, size_t size,
|
|
|
|
qnotify_t onfy, void *link);
|
|
|
|
void chOQResetI(output_queue_t *oqp);
|
|
|
|
msg_t chOQPutTimeout(output_queue_t *oqp, uint8_t b, systime_t time);
|
|
|
|
msg_t chOQGetI(output_queue_t *oqp);
|
|
|
|
size_t chOQWriteTimeout(output_queue_t *oqp, const uint8_t *bp,
|
|
|
|
size_t n, systime_t time);
|
|
|
|
#ifdef __cplusplus
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/*===========================================================================*/
|
|
|
|
/* Module inline functions. */
|
|
|
|
/*===========================================================================*/
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2011-05-18 17:54:55 +00:00
|
|
|
/**
|
|
|
|
* @brief Returns the filled space into an input queue.
|
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] iqp pointer to an @p input_queue_t structure
|
2011-05-18 17:54:55 +00:00
|
|
|
* @return The number of full bytes in the queue.
|
|
|
|
* @retval 0 if the queue is empty.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline size_t chIQGetFullI(input_queue_t *iqp) {
|
|
|
|
|
|
|
|
chDbgCheckClassI();
|
|
|
|
|
|
|
|
return (size_t)chQSpaceI(iqp);
|
|
|
|
}
|
2011-05-18 17:54:55 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Returns the empty space into an input queue.
|
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] iqp pointer to an @p input_queue_t structure
|
2011-05-18 17:54:55 +00:00
|
|
|
* @return The number of empty bytes in the queue.
|
|
|
|
* @retval 0 if the queue is full.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline size_t chIQGetEmptyI(input_queue_t *iqp) {
|
|
|
|
|
|
|
|
chDbgCheckClassI();
|
|
|
|
|
2015-03-06 10:13:59 +00:00
|
|
|
return (size_t)(chQSizeX(iqp) - chQSpaceI(iqp));
|
2013-08-09 13:43:56 +00:00
|
|
|
}
|
2011-05-18 17:54:55 +00:00
|
|
|
|
2010-09-21 10:22:06 +00:00
|
|
|
/**
|
2013-07-20 07:24:12 +00:00
|
|
|
* @brief Evaluates to @p true if the specified input queue is empty.
|
2011-01-01 11:48:59 +00:00
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] iqp pointer to an @p input_queue_t structure.
|
2011-01-01 11:48:59 +00:00
|
|
|
* @return The queue status.
|
2013-07-20 07:24:12 +00:00
|
|
|
* @retval false if the queue is not empty.
|
|
|
|
* @retval true if the queue is empty.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline bool chIQIsEmptyI(input_queue_t *iqp) {
|
|
|
|
|
|
|
|
chDbgCheckClassI();
|
|
|
|
|
2015-03-05 21:28:51 +00:00
|
|
|
return (bool)(chQSpaceI(iqp) <= 0U);
|
2013-08-09 13:43:56 +00:00
|
|
|
}
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2010-09-21 10:22:06 +00:00
|
|
|
/**
|
2013-07-20 07:24:12 +00:00
|
|
|
* @brief Evaluates to @p true if the specified input queue is full.
|
2011-01-01 11:48:59 +00:00
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] iqp pointer to an @p input_queue_t structure.
|
2011-01-01 11:48:59 +00:00
|
|
|
* @return The queue status.
|
2013-07-20 07:24:12 +00:00
|
|
|
* @retval false if the queue is not full.
|
|
|
|
* @retval true if the queue is full.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline bool chIQIsFullI(input_queue_t *iqp) {
|
|
|
|
|
|
|
|
chDbgCheckClassI();
|
|
|
|
|
2015-03-05 21:28:51 +00:00
|
|
|
return (bool)((iqp->q_wrptr == iqp->q_rdptr) && (iqp->q_counter != 0U));
|
2013-08-09 13:43:56 +00:00
|
|
|
}
|
2010-02-21 07:24:53 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Input queue read.
|
|
|
|
* @details This function reads a byte value from an input queue. If the queue
|
|
|
|
* is empty then the calling thread is suspended until a byte arrives
|
|
|
|
* in the queue.
|
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] iqp pointer to an @p input_queue_t structure
|
2010-09-21 10:22:06 +00:00
|
|
|
* @return A byte value from the queue.
|
2011-05-19 17:46:52 +00:00
|
|
|
* @retval Q_RESET if the queue has been reset.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @api
|
2010-02-21 07:24:53 +00:00
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline msg_t chIQGet(input_queue_t *iqp) {
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2013-08-09 13:43:56 +00:00
|
|
|
return chIQGetTimeout(iqp, TIME_INFINITE);
|
2010-02-21 07:24:53 +00:00
|
|
|
}
|
|
|
|
|
2011-08-23 10:09:08 +00:00
|
|
|
/**
|
|
|
|
* @brief Returns the filled space into an output queue.
|
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] oqp pointer to an @p output_queue_t structure
|
2011-08-23 10:09:08 +00:00
|
|
|
* @return The number of full bytes in the queue.
|
|
|
|
* @retval 0 if the queue is empty.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline size_t chOQGetFullI(output_queue_t *oqp) {
|
|
|
|
|
|
|
|
chDbgCheckClassI();
|
|
|
|
|
2015-03-06 10:13:59 +00:00
|
|
|
return (size_t)(chQSizeX(oqp) - chQSpaceI(oqp));
|
2013-08-09 13:43:56 +00:00
|
|
|
}
|
2011-05-18 17:54:55 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Returns the empty space into an output queue.
|
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] oqp pointer to an @p output_queue_t structure
|
2011-05-18 17:54:55 +00:00
|
|
|
* @return The number of empty bytes in the queue.
|
|
|
|
* @retval 0 if the queue is full.
|
|
|
|
*
|
|
|
|
* @iclass
|
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline size_t chOQGetEmptyI(output_queue_t *oqp) {
|
|
|
|
|
|
|
|
chDbgCheckClassI();
|
|
|
|
|
|
|
|
return (size_t)chQSpaceI(oqp);
|
|
|
|
}
|
2011-05-18 17:54:55 +00:00
|
|
|
|
2010-02-21 07:24:53 +00:00
|
|
|
/**
|
2013-07-20 07:24:12 +00:00
|
|
|
* @brief Evaluates to @p true if the specified output queue is empty.
|
2011-01-01 11:48:59 +00:00
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] oqp pointer to an @p output_queue_t structure.
|
2011-01-01 11:48:59 +00:00
|
|
|
* @return The queue status.
|
2013-07-20 07:24:12 +00:00
|
|
|
* @retval false if the queue is not empty.
|
|
|
|
* @retval true if the queue is empty.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @iclass
|
2010-02-21 07:24:53 +00:00
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline bool chOQIsEmptyI(output_queue_t *oqp) {
|
|
|
|
|
|
|
|
chDbgCheckClassI();
|
|
|
|
|
2015-03-05 21:28:51 +00:00
|
|
|
return (bool)((oqp->q_wrptr == oqp->q_rdptr) && (oqp->q_counter != 0U));
|
2013-08-09 13:43:56 +00:00
|
|
|
}
|
2010-02-21 07:24:53 +00:00
|
|
|
|
|
|
|
/**
|
2013-07-20 07:24:12 +00:00
|
|
|
* @brief Evaluates to @p true if the specified output queue is full.
|
2011-01-01 11:48:59 +00:00
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] oqp pointer to an @p output_queue_t structure.
|
2011-01-01 11:48:59 +00:00
|
|
|
* @return The queue status.
|
2013-07-20 07:24:12 +00:00
|
|
|
* @retval false if the queue is not full.
|
|
|
|
* @retval true if the queue is full.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @iclass
|
2010-02-21 07:24:53 +00:00
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline bool chOQIsFullI(output_queue_t *oqp) {
|
|
|
|
|
|
|
|
chDbgCheckClassI();
|
|
|
|
|
2015-03-05 21:28:51 +00:00
|
|
|
return (bool)(chQSpaceI(oqp) <= 0U);
|
2013-08-09 13:43:56 +00:00
|
|
|
}
|
2010-02-21 07:24:53 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* @brief Output queue write.
|
|
|
|
* @details This function writes a byte value to an output queue. If the queue
|
|
|
|
* is full then the calling thread is suspended until there is space
|
|
|
|
* in the queue.
|
|
|
|
*
|
2013-08-09 13:43:56 +00:00
|
|
|
* @param[in] oqp pointer to an @p output_queue_t structure
|
2010-02-21 07:24:53 +00:00
|
|
|
* @param[in] b the byte value to be written in the queue
|
2010-09-21 10:22:06 +00:00
|
|
|
* @return The operation status.
|
2010-02-21 07:24:53 +00:00
|
|
|
* @retval Q_OK if the operation succeeded.
|
2011-01-01 11:48:59 +00:00
|
|
|
* @retval Q_RESET if the queue has been reset.
|
2010-09-21 10:22:06 +00:00
|
|
|
*
|
|
|
|
* @api
|
2010-02-21 07:24:53 +00:00
|
|
|
*/
|
2013-08-09 13:43:56 +00:00
|
|
|
static inline msg_t chOQPut(output_queue_t *oqp, uint8_t b) {
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2013-08-09 13:43:56 +00:00
|
|
|
return chOQPutTimeout(oqp, b, TIME_INFINITE);
|
2010-02-21 07:24:53 +00:00
|
|
|
}
|
2013-07-20 10:12:44 +00:00
|
|
|
|
2015-03-05 21:28:51 +00:00
|
|
|
#endif /* CH_CFG_USE_QUEUES == TRUE */
|
2010-02-21 07:24:53 +00:00
|
|
|
|
2010-02-27 08:54:22 +00:00
|
|
|
#endif /* _CHQUEUES_H_ */
|
2010-02-21 07:24:53 +00:00
|
|
|
|
|
|
|
/** @} */
|