Lines Matching refs:Py_SIZE
37 Py_SIZE(self) = newsize;
70 Py_SIZE(self) = newsize;
159 Py_SIZE(op) = size;
173 return Py_SIZE(op);
185 if (i < 0 || i >= Py_SIZE(op)) {
209 if (i < 0 || i >= Py_SIZE(op)) {
225 Py_ssize_t i, n = Py_SIZE(self);
307 i = Py_SIZE(op);
339 for (i = 0; i < Py_SIZE(op); i++) {
373 if (Py_SIZE(v) == 0) {
384 for (i = 0; i < Py_SIZE(v); ++i) {
434 return Py_SIZE(a);
443 for (i = 0, cmp = 0 ; cmp == 0 && i < Py_SIZE(a); ++i)
452 if (i < 0 || i >= Py_SIZE(a)) {
474 else if (ilow > Py_SIZE(a))
475 ilow = Py_SIZE(a);
478 else if (ihigh > Py_SIZE(a))
479 ihigh = Py_SIZE(a);
519 size = Py_SIZE(a) + Py_SIZE(b);
528 for (i = 0; i < Py_SIZE(a); i++) {
534 dest = np->ob_item + Py_SIZE(a);
535 for (i = 0; i < Py_SIZE(b); i++) {
554 size = Py_SIZE(a) * n;
555 if (n && size/n != Py_SIZE(a))
564 if (Py_SIZE(a) == 1) {
575 for (j = 0; j < Py_SIZE(a); j++) {
592 i = Py_SIZE(a);
593 Py_SIZE(a) = 0;
639 v = list_slice(b, 0, Py_SIZE(b));
654 else if (ilow > Py_SIZE(a))
655 ilow = Py_SIZE(a);
659 else if (ihigh > Py_SIZE(a))
660 ihigh = Py_SIZE(a);
665 if (Py_SIZE(a) + d == 0) {
683 (Py_SIZE(a) - ihigh)*sizeof(PyObject *));
684 list_resize(a, Py_SIZE(a) + d);
688 k = Py_SIZE(a);
764 if (i < 0 || i >= Py_SIZE(a)) {
823 m = Py_SIZE(self);
856 m = Py_SIZE(self);
863 Py_SIZE(self) = m;
882 if (Py_SIZE(self) < self->allocated) {
884 PyList_SET_ITEM(self, Py_SIZE(self), item);
885 ++Py_SIZE(self);
896 if (Py_SIZE(self) < self->allocated)
897 list_resize(self, Py_SIZE(self)); /* shrinking can't fail */
936 if (Py_SIZE(self) == 0) {
942 i += Py_SIZE(self);
943 if (i < 0 || i >= Py_SIZE(self)) {
948 if (i == Py_SIZE(self) - 1) {
949 status = list_resize(self, Py_SIZE(self) - 1);
2086 saved_ob_size = Py_SIZE(self);
2089 Py_SIZE(self) = 0;
2195 i = Py_SIZE(self);
2196 Py_SIZE(self) = saved_ob_size;
2231 if (Py_SIZE(self) > 1)
2232 reverse_slice(self->ob_item, self->ob_item + Py_SIZE(self));
2245 if (Py_SIZE(self) > 1)
2246 reverse_slice(self->ob_item, self->ob_item + Py_SIZE(self));
2260 n = Py_SIZE(v);
2278 Py_ssize_t i, start=0, stop=Py_SIZE(self);
2287 start += Py_SIZE(self);
2292 stop += Py_SIZE(self);
2296 for (i = start; i < stop && i < Py_SIZE(self); i++) {
2326 for (i = 0; i < Py_SIZE(self); i++) {
2341 for (i = 0; i < Py_SIZE(self); i++) {
2361 for (i = Py_SIZE(o); --i >= 0; )
2380 if (Py_SIZE(vl) != Py_SIZE(wl) && (op == Py_EQ || op == Py_NE)) {
2392 for (i = 0; i < Py_SIZE(vl) && i < Py_SIZE(wl); i++) {
2401 if (i >= Py_SIZE(vl) || i >= Py_SIZE(wl)) {
2403 Py_ssize_t vs = Py_SIZE(vl);
2404 Py_ssize_t ws = Py_SIZE(wl);
2448 assert(0 <= Py_SIZE(self));
2449 assert(Py_SIZE(self) <= self->allocated || self->allocated == -1);
2561 if (PySlice_GetIndicesEx((PySliceObject*)item, Py_SIZE(self),
2610 if (PySlice_GetIndicesEx((PySliceObject*)item, Py_SIZE(self),
2662 if (cur + step >= (size_t)Py_SIZE(self)) {
2663 lim = Py_SIZE(self) - cur - 1;
2671 if (cur < (size_t)Py_SIZE(self)) {
2674 (Py_SIZE(self) - cur) *
2678 Py_SIZE(self) -= slicelength;
2679 list_resize(self, Py_SIZE(self));
