Lines Matching defs:BLOCKLEN
27 #define BLOCKLEN 64
28 #define CENTER ((BLOCKLEN - 1) / 2)
57 * 0 <= index < BLOCKLEN
60 * (d.leftindex + d.len - 1) % BLOCKLEN == d.rightindex
80 PyObject *data[BLOCKLEN];
88 Py_ssize_t leftindex; /* 0 <= leftindex < BLOCKLEN */
89 Py_ssize_t rightindex; /* 0 <= rightindex < BLOCKLEN */
170 assert(BLOCKLEN >= 2);
207 deque->rightindex = BLOCKLEN - 1;
237 if (deque->leftindex == BLOCKLEN) {
276 if (deque->rightindex == BLOCKLEN - 1) {
322 deque->leftindex = BLOCKLEN;
453 deque->leftindex = BLOCKLEN - 1;
454 deque->rightindex = BLOCKLEN - 2;
607 m = (BLOCKLEN - leftindex > n) ? n : BLOCKLEN - leftindex;
618 m = (n > BLOCKLEN) ? BLOCKLEN : n;
677 if (deque->rightindex == BLOCKLEN - 1) {
691 if (m > BLOCKLEN - 1 - deque->rightindex)
692 m = BLOCKLEN - 1 - deque->rightindex;
761 never need to move more than BLOCKLEN pointers, and that at least one
805 leftindex = BLOCKLEN;
834 rightindex = BLOCKLEN - 1;
838 if (rightindex == BLOCKLEN - 1) {
852 assert (rightindex < BLOCKLEN - 1);
857 if (m > BLOCKLEN - leftindex)
858 m = BLOCKLEN - leftindex;
859 if (m > BLOCKLEN - 1 - rightindex)
860 m = BLOCKLEN - 1 - rightindex;
871 if (leftindex == BLOCKLEN) {
944 if (leftindex == BLOCKLEN) {
953 rightindex = BLOCKLEN - 1;
991 if (index == BLOCKLEN) {
1027 if (index == BLOCKLEN) {
1073 for (i=0 ; i < start - BLOCKLEN ; i += BLOCKLEN) {
1078 if (index == BLOCKLEN) {
1099 if (index == BLOCKLEN) {
1188 n = (Py_ssize_t)((size_t) i / BLOCKLEN);
1189 i = (Py_ssize_t)((size_t) i % BLOCKLEN);
1197 / BLOCKLEN - n);
1250 if (index == BLOCKLEN) {
1281 n = (Py_ssize_t)((size_t) i / BLOCKLEN);
1282 i = (Py_ssize_t)((size_t) i % BLOCKLEN);
1290 / BLOCKLEN - n);
1333 for (index = indexlo; index < BLOCKLEN ; index++) {
1529 blocks = (size_t)(deque->leftindex + Py_SIZE(deque) + BLOCKLEN - 1) / BLOCKLEN;
1531 (blocks - 1) * BLOCKLEN + deque->rightindex);
1732 if (it->index == BLOCKLEN && it->counter > 0) {
1877 it->index = BLOCKLEN - 1;