https://sourceforge.net/p/erqwrewrin/wiki/Home/Recent changes to HomeenFri, 24 May 2013 06:02:39 -0000https://sourceforge.net/p/erqwrewrin/wiki/Home/<div class="markdown_content"><p>A ring buffer is a fast method to program a circular buffer. A ring buffer links a data structure into a circular pattern.<br /> The data structure is extremely simple: a bounded FIFO. One step up from plain arrays, but still, it’s very basic stuff. And if you’re doing system programming, particularly anything involving IO or directly talking to hardware.</p> <p>The producer produces commands/objects/whatever in some way and appends them to the queue. The consumer pops an item from the start and does its work. If the queue is full, the producer has to wait; if it’s empty, the consumer has to wait. As programmer feeding hardware (or being fed from hardware), you’re generally trying to reach a steady state that does neither.</p> <p>Ring Buffer Implementation</p> <p>Suppose we have a circular buffer of n slots.<br /> Pointers in (resp., out)points to the first empty(resp., filled) slot.</p></div>Senthilnathan DuraiveluFri, 24 May 2013 06:02:39 -0000https://sourceforge.net78b3f529989516a83f9077a6b381e79729b52f83https://sourceforge.net/p/erqwrewrin/wiki/Home/<div class="markdown_content"><p>Welcome to your wiki!</p> <p>This is the default page, edit it as you see fit. To add a new page simply reference it within brackets, e.g.: <span>[SamplePage]</span>.</p> <p>The wiki uses <a class="" href="/p/erqwrewrin/wiki/markdown_syntax/">Markdown</a> syntax.</p> <p><h6>Project Members:</h6><ul class="md-users-list"><li><a href="/u/dsnathan6/">Senthilnathan Duraivelu</a> (admin)</li></ul><br /> </p><p><span class="download-button-519df918a02bb153b4391238" style="margin-bottom: 1em; display: block;"></span></p></div>Senthilnathan DuraiveluThu, 23 May 2013 11:10:16 -0000https://sourceforge.neta15d911d10d3e247bcd8cc7629b1d9085e07726a