/* Now the old size, leftblock, and leftindex are disconnected from
the empty deque and we can use them to decref the pointers.
*/
- itemptr = &leftblock->data[leftindex];
m = (BLOCKLEN - leftindex > n) ? n : BLOCKLEN - leftindex;
+ itemptr = &leftblock->data[leftindex];
limit = &leftblock->data[leftindex + m];
n -= m;
while (1) {
CHECK_NOT_END(leftblock->rightlink);
prevblock = leftblock;
leftblock = leftblock->rightlink;
- itemptr = leftblock->data;
m = (n > BLOCKLEN) ? BLOCKLEN : n;
+ itemptr = leftblock->data;
limit = &leftblock->data[m];
n -= m;
freeblock(prevblock);