K 10
svn:author
V 5
gibbs
K 8
svn:date
V 27
1998-09-17T22:29:02.000000Z
K 7
svn:log
V 562
Really correct ncr_freeze_devq now.  We scan backwards from the current
insertion point into the start queue looking for entries to remove and
mark them with the 'skip' address, recording the entry furthest from the
insertion point that needs to be removed.  We then go through a second
loop starting at the furthest entry to be removed and compress the start
queue.  The old algorithm started at (old insert point + 1) and wrapped
through the whole queue which would end up moving the start position in
the queue out from under the nose of the scrip processor.

END