초록 ▼

A circular queue system is implemented using either a `mirror space` appended to the circular portion of the queue (or buffer) or an `borrow` space appended to the circular portion of the queue (or buffer). In each implementation, address verification or checking within the queue is not implemented

A circular queue system is implemented using either a `mirror space` appended to the circular portion of the queue (or buffer) or an `borrow` space appended to the circular portion of the queue (or buffer). In each implementation, address verification or checking within the queue is not implemented until such time as the read or write portion to the queue has substantially completed. Where the address would normally exceed the physical or logical end address of the circular queue, the `mirror space` or `borrow` space provides sufficient storage to prevent overflow into other valid data. Upon substantial completion of the read or write to the queue (or buffer), the present address of the pointer is determined, and where the circular portion of the queue (or buffer) has been traversed, the data in the `mirror space` is copied into the circular queue (or buffer) and the pointer's address is repositioned to be within the circular queue (or buffer), or for a `borrow` space, the pointer's address is reset to the queue's (or buffer's) physical or logical start address.

대표청구항 ▼

[ What is claimed is:] [1.]1. A method of using a circular queue comprising:accessing a queue first storage element within a circular portion of the queue and identified by an access pointer;accessing a queue second storage element outside the circular portion of the queue after traversing an end of

[ What is claimed is:] [1.]1. A method of using a circular queue comprising:accessing a queue first storage element within a circular portion of the queue and identified by an access pointer;accessing a queue second storage element outside the circular portion of the queue after traversing an end of the circular portion; andadjusting the access pointer by a value representing the number of storage elements accessed.