Humberto Bonasso <hbonasso@FLASHNET.IT> wrote:
> 4) two RAM pointers at "first input to serve" and "last input to acquire" (a
> little care must be taken handling wrap-around condition of the queue)

Andy Kunz <montana@FAST.NET> wrote:
> I suggest you make the queue perfectly circular.  It's much less code this
> way.  It also helps if the queue size is a power of 2.

There's some example circular buffer code including useful macros to advance
and wrap the pointers in my UART demo/test program:

        http://www.brouhaha.com/~eric/pic/uarttest.html

Cheers,
Eric