30 #define BLOCKLEN 64  macro
31 #define CENTER ((BLOCKLEN - 1) / 2)
82     PyObject *data[BLOCKLEN];
174     assert(BLOCKLEN >= 2);  in deque_new()
210             deque->rightindex = BLOCKLEN - 1;  in deque_pop()
240     if (deque->leftindex == BLOCKLEN) {  in deque_popleft()
279     if (deque->rightindex == BLOCKLEN - 1) {  in deque_append_internal()
325         deque->leftindex = BLOCKLEN;  in deque_appendleft_internal()
456         deque->leftindex = BLOCKLEN - 1;  in deque_extendleft()
457         deque->rightindex = BLOCKLEN - 2;  in deque_extendleft()
610     m = (BLOCKLEN - leftindex > n) ? n : BLOCKLEN - leftindex;  in deque_clear()
621             m = (n > BLOCKLEN) ? BLOCKLEN : n;  in deque_clear()
680             if (deque->rightindex == BLOCKLEN - 1) {  in deque_inplace_repeat()
694             if (m > BLOCKLEN - 1 - deque->rightindex)  in deque_inplace_repeat()
695                 m = BLOCKLEN - 1 - deque->rightindex;  in deque_inplace_repeat()
808             leftindex = BLOCKLEN;  in _deque_rotate()
837             rightindex = BLOCKLEN - 1;  in _deque_rotate()
841         if (rightindex == BLOCKLEN - 1) {  in _deque_rotate()
855         assert (rightindex < BLOCKLEN - 1);  in _deque_rotate()
860             if (m > BLOCKLEN - leftindex)  in _deque_rotate()
861                 m = BLOCKLEN - leftindex;  in _deque_rotate()
862             if (m > BLOCKLEN - 1 - rightindex)  in _deque_rotate()
863                 m = BLOCKLEN - 1 - rightindex;  in _deque_rotate()
874         if (leftindex == BLOCKLEN) {  in _deque_rotate()
936         if (leftindex == BLOCKLEN) {  in deque_reverse()
945             rightindex = BLOCKLEN - 1;  in deque_reverse()
983         if (index == BLOCKLEN) {  in deque_count()
1019         if (index == BLOCKLEN) {  in deque_contains()
1065     for (i=0 ; i < start - BLOCKLEN ; i += BLOCKLEN) {  in deque_index()
1070         if (index == BLOCKLEN) {  in deque_index()
1091         if (index == BLOCKLEN) {  in deque_index()
1212         n = (Py_ssize_t)((size_t) i / BLOCKLEN);  in deque_item()
1213         i = (Py_ssize_t)((size_t) i % BLOCKLEN);  in deque_item()
1221                     / BLOCKLEN - n);  in deque_item()
1263     n = (Py_ssize_t)((size_t) i / BLOCKLEN);  in deque_ass_item()
1264     i = (Py_ssize_t)((size_t) i % BLOCKLEN);  in deque_ass_item()
1272                 / BLOCKLEN - n);  in deque_ass_item()
1310         for (index = indexlo; index < BLOCKLEN ; index++) {  in deque_traverse()
1510     blocks = (size_t)(deque->leftindex + Py_SIZE(deque) + BLOCKLEN - 1) / BLOCKLEN;  in deque_sizeof()
1512            (blocks - 1) * BLOCKLEN + deque->rightindex);  in deque_sizeof()
1732     if (it->index == BLOCKLEN && it->counter > 0) {  in dequeiter_next()
1877         it->index = BLOCKLEN - 1;  in dequereviter_next()