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 if (n > 0 && Py_SIZE(a) > PY_SSIZE_T_MAX / n)
556 size = Py_SIZE(a) * n;
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) {
686 (Py_SIZE(a) - ihigh)*sizeof(PyObject *));
687 list_resize(a, Py_SIZE(a) + d);
691 k = Py_SIZE(a);
767 if (i < 0 || i >= Py_SIZE(a)) {
826 m = Py_SIZE(self);
859 m = Py_SIZE(self);
866 Py_SIZE(self) = m;
885 if (Py_SIZE(self) < self->allocated) {
887 PyList_SET_ITEM(self, Py_SIZE(self), item);
888 ++Py_SIZE(self);
899 if (Py_SIZE(self) < self->allocated)
900 list_resize(self, Py_SIZE(self)); /* shrinking can't fail */
939 if (Py_SIZE(self) == 0) {
945 i += Py_SIZE(self);
946 if (i < 0 || i >= Py_SIZE(self)) {
951 if (i == Py_SIZE(self) - 1) {
952 status = list_resize(self, Py_SIZE(self) - 1);
2090 saved_ob_size = Py_SIZE(self);
2093 Py_SIZE(self) = 0;
2199 i = Py_SIZE(self);
2200 Py_SIZE(self) = saved_ob_size;
2235 if (Py_SIZE(self) > 1)
2236 reverse_slice(self->ob_item, self->ob_item + Py_SIZE(self));
2249 if (Py_SIZE(self) > 1)
2250 reverse_slice(self->ob_item, self->ob_item + Py_SIZE(self));
2264 n = Py_SIZE(v);
2282 Py_ssize_t i, start=0, stop=Py_SIZE(self);
2291 start += Py_SIZE(self);
2296 stop += Py_SIZE(self);
2300 for (i = start; i < stop && i < Py_SIZE(self); i++) {
2330 for (i = 0; i < Py_SIZE(self); i++) {
2345 for (i = 0; i < Py_SIZE(self); i++) {
2365 for (i = Py_SIZE(o); --i >= 0; )
2384 if (Py_SIZE(vl) != Py_SIZE(wl) && (op == Py_EQ || op == Py_NE)) {
2396 for (i = 0; i < Py_SIZE(vl) && i < Py_SIZE(wl); i++) {
2405 if (i >= Py_SIZE(vl) || i >= Py_SIZE(wl)) {
2407 Py_ssize_t vs = Py_SIZE(vl);
2408 Py_ssize_t ws = Py_SIZE(wl);
2452 assert(0 <= Py_SIZE(self));
2453 assert(Py_SIZE(self) <= self->allocated || self->allocated == -1);
2565 if (PySlice_GetIndicesEx((PySliceObject*)item, Py_SIZE(self),
2614 if (PySlice_GetIndicesEx((PySliceObject*)item, Py_SIZE(self),
2666 if (cur + step >= (size_t)Py_SIZE(self)) {
2667 lim = Py_SIZE(self) - cur - 1;
2675 if (cur < (size_t)Py_SIZE(self)) {
2678 (Py_SIZE(self) - cur) *
2682 Py_SIZE(self) -= slicelength;
2683 list_resize(self, Py_SIZE(self));
