Implementing FIFO operations using TIE queues

This application note provides TIE and C code that demonstrate how to implement standard FIFO (First In, First Out) operations using TIE queues. The FIFO operations described in this document include testing for a full or empty FIFO, pushing a value onto a FIFO, and popping a value from a FIFO. This application note also shows how to describe the C data type of the values carried by a FIFO to ensure correct and efficient code generation by the Xtensa C/C++ compiler. The application note and included sample TIE and C code serve as examples for users implementing TIE queues in their designs.

View the PDF document for more information.