Overview

FIFO, another name for a queue, is an acronym for the way it works, First-In-First-Out. The standard interface to the FIFO queue consists of ENQUEUE()function, to add new elements, and a DEQUEUE(), function, which removes the oldest element. Enqueue adds an element at the rear(end) of the queue. Dequeue removes an element from the front (start) of the queue. The following are the operations, supported on queues:

Creates a queue
Enqueues an element into the queue.
Dequeues an element from the queue.
Walks through the queue.
Returns the number of elements in the queue.
Destroys the queue.

When creating a queue, you need to specify maximum size for the queue. If the maximum size is specified as 0, then you can enqueue any number of elements. Otherwise the number of elements you can enqueue is limited to the maximum size. That is, at any instant of time, the queue can have a maximum of maxSize number of elements, specified at the time of creation of queue.

This file contains the definitions and function prototypes for Queues.

Interaction with other components

Queue APIs depend on Operating System Abstraction Layer (OSAL) for memory allocation and free functions.