Lines Matching refs:BLOCKLEN

21 #define BLOCKLEN 64  macro
22 #define CENTER ((BLOCKLEN - 1) / 2)
73 PyObject *data[BLOCKLEN];
165 assert(BLOCKLEN >= 2); in deque_new()
201 deque->rightindex = BLOCKLEN - 1; in deque_pop()
231 if (deque->leftindex == BLOCKLEN) { in deque_popleft()
270 if (deque->rightindex == BLOCKLEN - 1) { in deque_append_internal()
316 deque->leftindex = BLOCKLEN; in deque_appendleft_internal()
406 if (deque->rightindex == BLOCKLEN - 1) { in deque_extend()
465 deque->leftindex = BLOCKLEN - 1; in deque_extendleft()
466 deque->rightindex = BLOCKLEN - 2; in deque_extendleft()
483 deque->leftindex = BLOCKLEN; in deque_extendleft()
638 m = (BLOCKLEN - leftindex > n) ? n : BLOCKLEN - leftindex; in deque_clear()
649 m = (n > BLOCKLEN) ? BLOCKLEN : n; in deque_clear()
708 if (deque->rightindex == BLOCKLEN - 1) { in deque_inplace_repeat()
722 if (m > BLOCKLEN - 1 - deque->rightindex) in deque_inplace_repeat()
723 m = BLOCKLEN - 1 - deque->rightindex; in deque_inplace_repeat()
836 leftindex = BLOCKLEN; in _deque_rotate()
865 rightindex = BLOCKLEN - 1; in _deque_rotate()
869 if (rightindex == BLOCKLEN - 1) { in _deque_rotate()
883 assert (rightindex < BLOCKLEN - 1); in _deque_rotate()
888 if (m > BLOCKLEN - leftindex) in _deque_rotate()
889 m = BLOCKLEN - leftindex; in _deque_rotate()
890 if (m > BLOCKLEN - 1 - rightindex) in _deque_rotate()
891 m = BLOCKLEN - 1 - rightindex; in _deque_rotate()
902 if (leftindex == BLOCKLEN) { in _deque_rotate()
964 if (leftindex == BLOCKLEN) { in deque_reverse()
973 rightindex = BLOCKLEN - 1; in deque_reverse()
1009 if (index == BLOCKLEN) { in deque_count()
1043 if (index == BLOCKLEN) { in deque_contains()
1092 if (index == BLOCKLEN) { in deque_index()
1113 if (index == BLOCKLEN) { in deque_index()
1234 n = (Py_ssize_t)((size_t) i / BLOCKLEN); in deque_item()
1235 i = (Py_ssize_t)((size_t) i % BLOCKLEN); in deque_item()
1243 / BLOCKLEN - n); in deque_item()
1285 n = (Py_ssize_t)((size_t) i / BLOCKLEN); in deque_ass_item()
1286 i = (Py_ssize_t)((size_t) i % BLOCKLEN); in deque_ass_item()
1294 / BLOCKLEN - n); in deque_ass_item()
1332 for (index = indexlo; index < BLOCKLEN ; index++) { in deque_traverse()
1528 blocks = (size_t)(deque->leftindex + Py_SIZE(deque) + BLOCKLEN - 1) / BLOCKLEN; in deque_sizeof()
1530 (blocks - 1) * BLOCKLEN + deque->rightindex); in deque_sizeof()
1748 if (it->index == BLOCKLEN && it->counter > 0) { in dequeiter_next()
1893 it->index = BLOCKLEN - 1; in dequereviter_next()