cbuffer

No. Suppose I have a ring buffer, and the dashes represent the first page, and the tildes represent the second page (which just aliases the first page), and each dash/tilde represents a single byte: https://i.imgur.com/NfZTICG.png p = memory address of the beginning of the first page o = the head index s = the size C = capacity = size of page Now suppose I wish to append 10 bytes. I would simply do: memcpy(p + (o + s) % C, input_data, 10) s += 10 Or, to remove 15 bytes from the beginning, I would do: o = (o + 15) % C s -= 15 Because any given 'slice' of the ring buffer's space can be represented as a contiguous range of memory (thanks to the second page), I can use the already optimized memcpy routine for adding and removing data at the beginning or end of the buffer. But I still need to make sure that the head index is always updated mod

The double-mapped ring buffer trick is so clever I can't help but wish I invented it. :) Here's the code for the GNU radio implementation described in the article, it's a good reference for some various ways to set up the mappings: https://github.com/gnuradio/gnuradio/blob/master/gnuradio-ru... https://github.com/gnuradio/gnuradio/blob/master/gnuradio-ru... https://github.com/gnuradio/gnuradio/blob/master/gnuradio-ru... And here some other links to implementations I've collected: http://vrb.sourceforge.net/ https://fgiesen.wordpress.com/2012/07/21/the-magic-ring-buff... https://gist.github.com/rygorous/3158316 https://www.mikeash.com/pyblog/friday-qa-2012-02-03-ring-buf... https://www.mikeash.com/pyblog/friday-qa-2012-02-17-ring-buf... https://github.com/mikeash/MAMirroredQueue http://atastypixel.com/blog/a-simple-fast-circular-buffer-im.

This is another interesting ring buffer implementation that uses mmap. https://github.com/willemt/cbuffer