A loop linear address FIFO queue (FIFO), is used for communication tasks, with the following characteristics: 1. Circular queue, space utilization is very high, do not dynamically allocate memory, do not use the list, no memory leaks, No memory fragmentation 2. linear address space, and out of direct use of memcpy is very fast instructions: 1.fifo_init 2.fifo_into 2.fifo_get 3.fifo_remove 4.fifo_uninit such as problem contact me: lxj_com@163.com QQ : 67016879

debug\debug.h
fifo\fifo.c
....\fifo.h
....\fifo.o
debug
fifo
readme.txt
fifo.jpg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．