commit c22eee6b5917568933bbfec2be1069a4340efd84
author Raymond Hettinger <python@rcn.com> Sat Sep 26 02:14:50 2015 -0700
committer Raymond Hettinger <python@rcn.com> Sat Sep 26 02:14:50 2015 -0700
tree caa054f444db64cc8c7085bf93f6567e4543889a
parent 7a84552c84867b548a72b20c177542e892c528f6

Precomputing the number iterations allows the inner-loop to be vectorizable.

Modules/_collectionsmodule.c

diff --git a/Modules/_collectionsmodule.c b/Modules/_collectionsmodule.c
index 2dcdf8b..487c765 100644
--- a/Modules/_collectionsmodule.c
+++ b/Modules/_collectionsmodule.c
@@ -557,7 +557,7 @@
 static PyObject *
 deque_inplace_repeat(dequeobject *deque, Py_ssize_t n)
 {
-    Py_ssize_t i, size;
+    Py_ssize_t i, m, size;
     PyObject *seq;
     PyObject *rv;
 
@@ -598,7 +598,11 @@
                 MARK_END(b->rightlink);
                 deque->rightindex = -1;
             }
-            for ( ; i < n-1 && deque->rightindex != BLOCKLEN - 1 ; i++) {
+            m = n - 1 - i;
+            if (m > BLOCKLEN - 1 - deque->rightindex)
+                m = BLOCKLEN - 1 - deque->rightindex;
+            i += m;
+            while (m--) {
                 deque->rightindex++;
                 Py_INCREF(item);
                 deque->rightblock->data[deque->rightindex] = item;