Global Sources
EE Times-India
 
EE Times-India > EDA/IP
 
 
EDA/IP  

Use TIE queues in FIFO operations

Posted: 25 Sep 2008     Print Version  Bookmark and Share

Keywords:TIE queue  C code  FIFO operations 

This application note provides TIE and C code that demonstrate how to implement standard 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. Both blocking and non-blocking versions of the push and pop operations are described (the non-blocking push and pop operations can only be implemented on Xtensa LX2 or later cores). 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.

A TIE queue can be used in many ways that are beyond the scope of this application note. For example, a queue can be accessed conditionally, a queue access can be combined with computation, and multiple queues can be accessed in a single operation.

View the PDF document for more information.





Comment on "Use TIE queues in FIFO operations"
Comments:  
*  You can enter [0] more charecters.
*Verify code:
 
 
Webinars

Seminars

Visit Asia Webinars to learn about the latest in technology and get practical design tips.

 

Go to top             Connect on Facebook      Follow us on Twitter      Follow us on Orkut

 
Back to Top