Method and apparatus for improving queue traversal time
A method and apparatus for traversing a queue of commands through part or all of the queue by selecting only the commands that need to be reissued. Commands to be reissued are labeled or designated as valid. The method may be practiced by setting a next valid address pointer in all queue entries. Queue traversal may be forward, backward, or bi-directional.
1. A method for traversing a queue, comprising:
issuing a command;
determining if the command needs to be reissued;
clearing a validity flag for the command if the command does not need to be reissued;
determining the location of the next command to be reissued; and
associating the location of the next command to be reissued with the command that needs to be reissued,
wherein the command that needs to be reissued and the next command to be reissued are stored in a queue;
in parallel with the clearing step, updating the queue whereby a current valid address pointer is maintained in each entry of the queue,
wherein the queue is updated by a next valid address logic which is independent from a queue processing logic,
wherein each entry in the queue includes a valid address pointer to a successor entry which has a valid address,
wherein a next valid address pointer for each entry of the queue of commands is calculated by the next valid address logic.
2. A method or traversing a queue, comprising:
determining if an entry in the queue needs to be accessed,
wherein each entry in the queue includes a valid address pointer to a successor entry which has a valid address;
setting a validity flag to a first state for the entry if the command needs to be accessed, otherwise setting the validity flag to a second state for the entry;
determining the location of the next queue entry to be accessed;
associating the location of the next queue entry to be accessed with the entry that needs to be accessed; and
updating the queue whereby a current valid address pointer is maintained in each entry of the queue of commands,
wherein the queue is updated by a next valid address logic which is independent from a queue processing logic,
wherein a next valid address pointer for each entry of the queue is calculated by the next valid address logic.