Lines Matching full:for
19 * FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
20 * COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
46 * Type by which queues are referenced. For example, a call to xQueueCreate()
54 * Type by which queue sets are referenced. For example, a call to
67 /* For internal use only. */
72 /* For internal use only. These definitions *must* match those in queue.c. */
108 * that will be copied for each posted item. Each item on the queue must be
182 * that will be copied for each posted item. Each item on the queue must be
250 * @param xQueue The queue for which to retrieve the buffers.
279 * routine. See xQueueSendFromISR () for an alternative which may be used
290 * waiting for space to become available on the queue, should it already
323 * // Send an uint32_t. Wait for 10 ticks for space to become
362 * routine. See xQueueSendFromISR () for an alternative which may be used
373 * waiting for space to become available on the queue, should it already
406 * // Send an uint32_t. Wait for 10 ticks for space to become
441 * This is a macro that calls xQueueGenericSend(). It is included for
448 * See xQueueSendFromISR () for an alternative which may be used in an ISR.
458 * waiting for space to become available on the queue, should it already
491 * // Send an uint32_t. Wait for 10 ticks for space to become
525 * Only for use with queues that have a length of one - so the queue is either
532 * See xQueueOverwriteFromISR () for an alternative which may be used in an ISR.
617 * See xQueueSendFromISR () for an alternative which may be used in an ISR.
627 * waiting for space to become available on the queue, should it already
634 * at the front of the queue (for high priority messages).
664 * // Send an uint32_t. Wait for 10 ticks for space to become
710 * xQueuePeekFromISR() for an alternative that can be called from an interrupt
720 * waiting for an item to receive should the queue be empty at the time
769 * // Peek a message on the created queue. Block for 10 ticks if a
840 * xQueueReceiveFromISR for an alternative that can.
849 * waiting for an item to receive should the queue be empty at the time
898 * // Receive a message on the created queue. Block for 10 ticks if a
959 * Delete a queue - freeing all the memory allocated for storing of items
1004 * Example usage for buffered IO (where the ISR can obtain more than one value
1076 * Example usage for buffered IO (where the ISR can obtain more than one value
1125 * Only for use with queues that can hold a single item - so the queue is either
1192 * // page for the port being used.
1214 * for backward compatibility with versions of FreeRTOS.org that did not
1241 * Example usage for buffered IO (where the ISR can obtain more than one value
1269 * // refer to the documentation page for the port being used.
1295 * equivalent for use by semaphores that don't actually copy any data.
1319 * at the front of the queue (for high priority messages).
1324 * Example usage for buffered IO (where the ISR can obtain more than one value
1352 * // refer to the documentation page for the port being used.
1387 * @param pxHigherPriorityTaskWoken A task may be blocked waiting for space to
1416 * // is full then this task will block for xTicksToWait ticks.
1470 * The functions defined above are for passing data to and from tasks. The
1471 * functions below are the equivalents for passing data to and from
1494 * For internal use only. Use xSemaphoreCreateMutex(),
1525 * For internal use only. Use xSemaphoreTakeMutexRecursive() or
1539 * The registry is provided as a means for kernel aware debuggers to
1547 * within FreeRTOSConfig.h for the registry to be available. Its value
1570 * The registry is provided as a means for kernel aware debuggers to
1584 * The queue registry is provided as a means for kernel aware debuggers to
1638 * See FreeRTOS/Source/Demo/Common/Minimal/QueueSet.c for an example using this
1649 * for reasons why queue sets are very rarely needed in practice as there are
1655 * Note 3: An additional 4 bytes of RAM is required for each space in a every
1690 * See FreeRTOS/Source/Demo/Common/Minimal/QueueSet.c for an example using this
1717 * See FreeRTOS/Source/Demo/Common/Minimal/QueueSet.c for an example using this
1742 * See FreeRTOS/Source/Demo/Common/Minimal/QueueSet.c for an example using this
1746 * for reasons why queue sets are very rarely needed in practice as there are
1759 * remain in the Blocked state (with other tasks executing) to wait for a member
1760 * of the queue set to be ready for a successful queue read or semaphore take