Commit a982e95c authored by Raymond Hettinger's avatar Raymond Hettinger

Issue 16398: Use memcpy() in deque.rotate().

parent 53ba32c7
...@@ -413,9 +413,8 @@ deque_inplace_concat(dequeobject *deque, PyObject *other) ...@@ -413,9 +413,8 @@ deque_inplace_concat(dequeobject *deque, PyObject *other)
static int static int
_deque_rotate(dequeobject *deque, Py_ssize_t n) _deque_rotate(dequeobject *deque, Py_ssize_t n)
{ {
Py_ssize_t i, len=deque->len, halflen=(len+1)>>1; Py_ssize_t i, m, len=deque->len, halflen=(len+1)>>1;
PyObject *item; block *prevblock;
block *prevblock, *leftblock, *rightblock;
if (len <= 1) if (len <= 1)
return 0; return 0;
...@@ -429,64 +428,75 @@ _deque_rotate(dequeobject *deque, Py_ssize_t n) ...@@ -429,64 +428,75 @@ _deque_rotate(dequeobject *deque, Py_ssize_t n)
assert(deque->len > 1); assert(deque->len > 1);
deque->state++; deque->state++;
leftblock = deque->leftblock; for (i=0 ; i<n ; ) {
rightblock = deque->rightblock; if (deque->leftindex == 0) {
for (i=0 ; i<n ; i++) { block *b = newblock(NULL, deque->leftblock, deque->len);
item = rightblock->data[deque->rightindex]; if (b == NULL)
assert (item != NULL); return -1;
deque->rightindex--; assert(deque->leftblock->leftlink == NULL);
deque->leftblock->leftlink = b;
deque->leftblock = b;
deque->leftindex = BLOCKLEN;
}
assert(deque->leftindex > 0);
m = n - i;
if (m > deque->rightindex + 1)
m = deque->rightindex + 1;
if (m > deque->leftindex)
m = deque->leftindex;
assert (m > 0);
memcpy(&deque->leftblock->data[deque->leftindex - m],
&deque->rightblock->data[deque->rightindex - m + 1],
m * sizeof(PyObject *));
deque->rightindex -= m;
deque->leftindex -= m;
i += m;
if (deque->rightindex == -1) { if (deque->rightindex == -1) {
assert(rightblock != NULL); assert(deque->rightblock != NULL);
prevblock = rightblock->leftlink; prevblock = deque->rightblock->leftlink;
assert(leftblock != rightblock); assert(deque->leftblock != deque->rightblock);
freeblock(rightblock); freeblock(deque->rightblock);
prevblock->rightlink = NULL; prevblock->rightlink = NULL;
deque->rightblock = rightblock = prevblock; deque->rightblock = prevblock;
deque->rightindex = BLOCKLEN - 1; deque->rightindex = BLOCKLEN - 1;
} }
if (deque->leftindex == 0) { }
block *b = newblock(NULL, leftblock, deque->len); for (i=0 ; i>n ; ) {
if (b == NULL) { if (deque->rightindex == BLOCKLEN - 1) {
deque->len--; block *b = newblock(deque->rightblock, NULL, deque->len);
Py_DECREF(item); if (b == NULL)
return -1; return -1;
} assert(deque->rightblock->rightlink == NULL);
assert(leftblock->leftlink == NULL); deque->rightblock->rightlink = b;
leftblock->leftlink = b; deque->rightblock = b;
deque->leftblock = leftblock = b; deque->rightindex = -1;
deque->leftindex = BLOCKLEN;
} }
deque->leftindex--; assert (deque->rightindex < BLOCKLEN - 1);
leftblock->data[deque->leftindex] = item;
} m = i - n;
for (i=0 ; i>n ; i--) { if (m > BLOCKLEN - deque->leftindex)
assert(leftblock != NULL); m = BLOCKLEN - deque->leftindex;
item = leftblock->data[deque->leftindex]; if (m > BLOCKLEN - 1 - deque->rightindex)
assert (item != NULL); m = BLOCKLEN - 1 - deque->rightindex;
deque->leftindex++; assert (m > 0);
memcpy(&deque->rightblock->data[deque->rightindex + 1],
&deque->leftblock->data[deque->leftindex],
m * sizeof(PyObject *));
deque->leftindex += m;
deque->rightindex += m;
i -= m;
if (deque->leftindex == BLOCKLEN) { if (deque->leftindex == BLOCKLEN) {
assert(leftblock != rightblock); assert(deque->leftblock != deque->rightblock);
prevblock = leftblock->rightlink; prevblock = deque->leftblock->rightlink;
freeblock(leftblock); freeblock(deque->leftblock);
assert(prevblock != NULL); assert(prevblock != NULL);
prevblock->leftlink = NULL; prevblock->leftlink = NULL;
deque->leftblock = leftblock = prevblock; deque->leftblock = prevblock;
deque->leftindex = 0; deque->leftindex = 0;
} }
if (deque->rightindex == BLOCKLEN-1) {
block *b = newblock(rightblock, NULL, deque->len);
if (b == NULL) {
deque->len--;
Py_DECREF(item);
return -1;
}
assert(rightblock->rightlink == NULL);
rightblock->rightlink = b;
deque->rightblock = rightblock = b;
deque->rightindex = -1;
}
deque->rightindex++;
rightblock->data[deque->rightindex] = item;
} }
return 0; return 0;
} }
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment