}
if (j < len) {
- Py_SIZE(newlist) = j;
+ Py_SET_SIZE(newlist, j);
}
j = PyList_GET_SIZE(newlist);
len = PyList_GET_SIZE(self->fut_callbacks);
MARK_END(b->rightlink);
assert(BLOCKLEN >= 2);
- Py_SIZE(deque) = 0;
+ Py_SET_SIZE(deque, 0);
deque->leftblock = b;
deque->rightblock = b;
deque->leftindex = CENTER + 1;
}
item = deque->rightblock->data[deque->rightindex];
deque->rightindex--;
- Py_SIZE(deque)--;
+ Py_SET_SIZE(deque, Py_SIZE(deque) - 1);
deque->state++;
if (deque->rightindex < 0) {
assert(deque->leftblock != NULL);
item = deque->leftblock->data[deque->leftindex];
deque->leftindex++;
- Py_SIZE(deque)--;
+ Py_SET_SIZE(deque, Py_SIZE(deque) - 1);
deque->state++;
if (deque->leftindex == BLOCKLEN) {
MARK_END(b->rightlink);
deque->rightindex = -1;
}
- Py_SIZE(deque)++;
+ Py_SET_SIZE(deque, Py_SIZE(deque) + 1);
deque->rightindex++;
deque->rightblock->data[deque->rightindex] = item;
if (NEEDS_TRIM(deque, maxlen)) {
MARK_END(b->leftlink);
deque->leftindex = BLOCKLEN;
}
- Py_SIZE(deque)++;
+ Py_SET_SIZE(deque, Py_SIZE(deque) + 1);
deque->leftindex--;
deque->leftblock->data[deque->leftindex] = item;
if (NEEDS_TRIM(deque, deque->maxlen)) {
/* Set the deque to be empty using the newly allocated block */
MARK_END(b->leftlink);
MARK_END(b->rightlink);
- Py_SIZE(deque) = 0;
+ Py_SET_SIZE(deque, 0);
deque->leftblock = b;
deque->rightblock = b;
deque->leftindex = CENTER + 1;
if (deque->rightindex == BLOCKLEN - 1) {
block *b = newblock();
if (b == NULL) {
- Py_SIZE(deque) += i;
+ Py_SET_SIZE(deque, Py_SIZE(deque) + i);
return NULL;
}
b->leftlink = deque->rightblock;
deque->rightblock->data[deque->rightindex] = item;
}
}
- Py_SIZE(deque) += i;
+ Py_SET_SIZE(deque, Py_SIZE(deque) + i);
Py_INCREF(deque);
return (PyObject *)deque;
}
i--;
}
- Py_SIZE(pylong) = i;
+ Py_SET_SIZE(pylong, i);
if (mpd_isnegative(x) && !mpd_iszero(x)) {
- Py_SIZE(pylong) = -i;
+ Py_SET_SIZE(pylong, -i);
}
mpd_del(x);
if (!(self = PyObject_New(Pdata, &Pdata_Type)))
return NULL;
- Py_SIZE(self) = 0;
+ Py_SET_SIZE(self, 0);
self->mark_set = 0;
self->fence = 0;
self->allocated = 8;
while (--i >= clearto) {
Py_CLEAR(self->data[i]);
}
- Py_SIZE(self) = clearto;
+ Py_SET_SIZE(self, clearto);
return 0;
}
Pdata_stack_underflow(self);
return NULL;
}
- return self->data[--Py_SIZE(self)];
+ Py_SET_SIZE(self, Py_SIZE(self) - 1);
+ return self->data[Py_SIZE(self)];
}
#define PDATA_POP(D, V) do { (V) = Pdata_pop((D)); } while (0)
if (Py_SIZE(self) == self->allocated && Pdata_grow(self) < 0) {
return -1;
}
- self->data[Py_SIZE(self)++] = obj;
+ self->data[Py_SIZE(self)] = obj;
+ Py_SET_SIZE(self, Py_SIZE(self) + 1);
return 0;
}
for (i = start, j = 0; j < len; i++, j++)
PyTuple_SET_ITEM(tuple, j, self->data[i]);
- Py_SIZE(self) = start;
+ Py_SET_SIZE(self, start);
return tuple;
}
for (i = start, j = 0; j < len; i++, j++)
PyList_SET_ITEM(list, j, self->data[i]);
- Py_SIZE(self) = start;
+ Py_SET_SIZE(self, start);
return list;
}
else {
len--;
Py_DECREF(self->stack->data[len]);
- Py_SIZE(self->stack) = len;
+ Py_SET_SIZE(self->stack, len);
}
return 0;
}
result = _Pickle_FastCall(append_func, value);
if (result == NULL) {
Pdata_clear(self->stack, i + 1);
- Py_SIZE(self->stack) = x;
+ Py_SET_SIZE(self->stack, x);
Py_DECREF(append_func);
return -1;
}
Py_DECREF(result);
}
- Py_SIZE(self->stack) = x;
+ Py_SET_SIZE(self->stack, x);
Py_DECREF(append_func);
}
}
result = _Pickle_FastCall(add_func, item);
if (result == NULL) {
Pdata_clear(self->stack, i + 1);
- Py_SIZE(self->stack) = mark;
+ Py_SET_SIZE(self->stack, mark);
return -1;
}
Py_DECREF(result);
}
- Py_SIZE(self->stack) = mark;
+ Py_SET_SIZE(self->stack, mark);
}
return 0;
if (self->allocated >= newsize &&
Py_SIZE(self) < newsize + 16 &&
self->ob_item != NULL) {
- Py_SIZE(self) = newsize;
+ Py_SET_SIZE(self, newsize);
return 0;
}
if (newsize == 0) {
PyMem_FREE(self->ob_item);
self->ob_item = NULL;
- Py_SIZE(self) = 0;
+ Py_SET_SIZE(self, 0);
self->allocated = 0;
return 0;
}
return -1;
}
self->ob_item = items;
- Py_SIZE(self) = newsize;
+ Py_SET_SIZE(self, newsize);
self->allocated = _new_size;
return 0;
}
op->ob_descr = descr;
op->allocated = size;
op->weakreflist = NULL;
- Py_SIZE(op) = size;
+ Py_SET_SIZE(op, size);
if (size <= 0) {
op->ob_item = NULL;
}
return NULL;
}
self->ob_item = item;
- Py_SIZE(self) = n / sizeof(Py_UNICODE);
+ Py_SET_SIZE(self, n / sizeof(Py_UNICODE));
memcpy(item, ustr, n);
self->allocated = Py_SIZE(self);
}
if (g == NULL)
return (PyVarObject *)PyErr_NoMemory();
op = (PyVarObject *) FROM_GC(g);
- Py_SIZE(op) = nitems;
+ Py_SET_SIZE(op, nitems);
return op;
}
memcpy(new->ob_bytes, bytes, size);
new->ob_bytes[size] = '\0'; /* Trailing null byte */
}
- Py_SIZE(new) = size;
+ Py_SET_SIZE(new, size);
new->ob_alloc = alloc;
new->ob_start = new->ob_bytes;
new->ob_exports = 0;
}
else {
/* Minor downsize; quick exit */
- Py_SIZE(self) = size;
+ Py_SET_SIZE(self, size);
PyByteArray_AS_STRING(self)[size] = '\0'; /* Trailing null */
return 0;
}
}
obj->ob_bytes = obj->ob_start = sval;
- Py_SIZE(self) = size;
+ Py_SET_SIZE(self, size);
obj->ob_alloc = alloc;
obj->ob_bytes[size] = '\0'; /* Trailing null byte */
}
/* memmove() removed bytes, the bytearray object cannot be
restored in its previous state. */
- Py_SIZE(self) += growth;
+ Py_SET_SIZE(self, Py_SIZE(self) + growth);
res = -1;
}
buf = PyByteArray_AS_STRING(self);
/* Append the byte */
if (Py_SIZE(self) + 1 < self->ob_alloc) {
- Py_SIZE(self)++;
+ Py_SET_SIZE(self, Py_SIZE(self) + 1);
PyByteArray_AS_STRING(self)[Py_SIZE(self)] = '\0';
}
else if (PyByteArray_Resize((PyObject *)self, Py_SIZE(self)+1) < 0)
}
_Py_NewReference(*pv);
sv = (PyBytesObject *) *pv;
- Py_SIZE(sv) = newsize;
+ Py_SET_SIZE(sv, newsize);
sv->ob_sval[newsize] = '\0';
sv->ob_shash = -1; /* invalidate cached hash value */
return 0;
*/
if (allocated >= newsize && newsize >= (allocated >> 1)) {
assert(self->ob_item != NULL || newsize == 0);
- Py_SIZE(self) = newsize;
+ Py_SET_SIZE(self, newsize);
return 0;
}
return -1;
}
self->ob_item = items;
- Py_SIZE(self) = newsize;
+ Py_SET_SIZE(self, newsize);
self->allocated = new_allocated;
return 0;
}
return PyErr_NoMemory();
}
}
- Py_SIZE(op) = size;
+ Py_SET_SIZE(op, size);
op->allocated = size;
_PyObject_GC_TRACK(op);
return (PyObject *) op;
Py_INCREF(v);
dest[i] = v;
}
- Py_SIZE(np) = len;
+ Py_SET_SIZE(np, len);
return (PyObject *)np;
}
Py_INCREF(v);
dest[i] = v;
}
- Py_SIZE(np) = size;
+ Py_SET_SIZE(np, size);
return (PyObject *)np;
#undef b
}
}
}
}
- Py_SIZE(np) = size;
+ Py_SET_SIZE(np, size);
return (PyObject *) np;
}
/* Because XDECREF can recursively invoke operations on
this list, we make it empty first. */
i = Py_SIZE(a);
- Py_SIZE(a) = 0;
+ Py_SET_SIZE(a, 0);
a->ob_item = NULL;
a->allocated = 0;
while (--i >= 0) {
if (list_resize(self, mn) < 0)
goto error;
/* Make the list sane again. */
- Py_SIZE(self) = m;
+ Py_SET_SIZE(self, m);
}
/* Run iterator to exhaustion. */
if (Py_SIZE(self) < self->allocated) {
/* steals ref */
PyList_SET_ITEM(self, Py_SIZE(self), item);
- ++Py_SIZE(self);
+ Py_SET_SIZE(self, Py_SIZE(self) + 1);
}
else {
int status = app1(self, item);
saved_ob_size = Py_SIZE(self);
saved_ob_item = self->ob_item;
saved_allocated = self->allocated;
- Py_SIZE(self) = 0;
+ Py_SET_SIZE(self, 0);
self->ob_item = NULL;
self->allocated = -1; /* any operation will reset it to >= 0 */
keyfunc_fail:
final_ob_item = self->ob_item;
i = Py_SIZE(self);
- Py_SIZE(self) = saved_ob_size;
+ Py_SET_SIZE(self, saved_ob_size);
self->ob_item = saved_ob_item;
self->allocated = saved_allocated;
if (final_ob_item != NULL) {
Py_INCREF(it);
dest[i] = it;
}
- Py_SIZE(result) = slicelength;
+ Py_SET_SIZE(result, slicelength);
return result;
}
}
sizeof(PyObject *));
}
- Py_SIZE(self) -= slicelength;
+ Py_SET_SIZE(self, Py_SIZE(self) - slicelength);
res = list_resize(self, Py_SIZE(self));
for (i = 0; i < slicelength; i++) {
x = (PyLongObject *)*x_p;
if (Py_REFCNT(x) == 1) {
- Py_SIZE(x) = -Py_SIZE(x);
+ Py_SET_SIZE(x, -Py_SIZE(x));
return;
}
while (i > 0 && v->ob_digit[i-1] == 0)
--i;
- if (i != j)
- Py_SIZE(v) = (Py_SIZE(v) < 0) ? -(i) : i;
+ if (i != j) {
+ Py_SET_SIZE(v, (Py_SIZE(v) < 0) ? -(i) : i);
+ }
return v;
}
}
result = _PyLong_New(i);
if (result != NULL) {
- Py_SIZE(result) = Py_SIZE(src);
- while (--i >= 0)
+ Py_SET_SIZE(result, Py_SIZE(src));
+ while (--i >= 0) {
result->ob_digit[i] = src->ob_digit[i];
+ }
}
return (PyObject *)result;
}
if (!(abs_ival >> PyLong_SHIFT)) {
v = _PyLong_New(1);
if (v) {
- Py_SIZE(v) = sign;
+ Py_SET_SIZE(v, sign);
v->ob_digit[0] = Py_SAFE_DOWNCAST(
abs_ival, unsigned long, digit);
}
if (!(abs_ival >> 2*PyLong_SHIFT)) {
v = _PyLong_New(2);
if (v) {
- Py_SIZE(v) = 2*sign;
+ Py_SET_SIZE(v, 2 * sign);
v->ob_digit[0] = Py_SAFE_DOWNCAST(
abs_ival & PyLong_MASK, unsigned long, digit);
v->ob_digit[1] = Py_SAFE_DOWNCAST(
v = _PyLong_New(ndigits);
if (v != NULL) {
digit *p = v->ob_digit;
- Py_SIZE(v) = ndigits*sign;
+ Py_SET_SIZE(v, ndigits * sign);
t = abs_ival;
while (t) {
*p++ = Py_SAFE_DOWNCAST(
frac = frac - (double)bits;
frac = ldexp(frac, PyLong_SHIFT);
}
- if (neg)
- Py_SIZE(v) = -(Py_SIZE(v));
+ if (neg) {
+ Py_SET_SIZE(v, -(Py_SIZE(v)));
+ }
return (PyObject *)v;
}
}
}
- Py_SIZE(v) = is_signed ? -idigit : idigit;
+ Py_SET_SIZE(v, is_signed ? -idigit : idigit);
return (PyObject *)long_normalize(v);
}
v = _PyLong_New(ndigits);
if (v != NULL) {
digit *p = v->ob_digit;
- Py_SIZE(v) = negative ? -ndigits : ndigits;
+ Py_SET_SIZE(v, negative ? -ndigits : ndigits);
t = abs_ival;
while (t) {
*p++ = (digit)(t & PyLong_MASK);
v = _PyLong_New(ndigits);
if (v != NULL) {
digit *p = v->ob_digit;
- Py_SIZE(v) = negative ? -ndigits : ndigits;
+ Py_SET_SIZE(v, negative ? -ndigits : ndigits);
t = abs_ival;
while (t) {
*p++ = (digit)(t & PyLong_MASK);
if (z == NULL) {
return NULL;
}
- Py_SIZE(z) = 0;
+ Py_SET_SIZE(z, 0);
/* `convwidth` consecutive input digits are treated as a single
* digit in base `convmultmax`.
assert(c < PyLong_BASE);
if (Py_SIZE(z) < size_z) {
*pz = (digit)c;
- ++Py_SIZE(z);
+ Py_SET_SIZE(z, Py_SIZE(z) + 1);
}
else {
PyLongObject *tmp;
goto onError;
}
if (sign < 0) {
- Py_SIZE(z) = -(Py_SIZE(z));
+ Py_SET_SIZE(z, -(Py_SIZE(z)));
}
while (*str && Py_ISSPACE(*str)) {
str++;
}
assert(borrow == 0);
if (sign < 0) {
- Py_SIZE(z) = -Py_SIZE(z);
+ Py_SET_SIZE(z, -Py_SIZE(z));
}
return maybe_small_long(long_normalize(z));
}
That also means z is not an element of
small_ints, so negating it in-place is safe. */
assert(Py_REFCNT(z) == 1);
- Py_SIZE(z) = -(Py_SIZE(z));
+ Py_SET_SIZE(z, -(Py_SIZE(z)));
}
}
else
z = x_add(a, b);
if (z != NULL) {
assert(Py_SIZE(z) == 0 || Py_REFCNT(z) == 1);
- Py_SIZE(z) = -(Py_SIZE(z));
+ Py_SET_SIZE(z, -(Py_SIZE(z)));
}
}
}
/* Multiply the next slice of b by a. */
memcpy(bslice->ob_digit, b->ob_digit + nbdone,
nbtouse * sizeof(digit));
- Py_SIZE(bslice) = nbtouse;
+ Py_SET_SIZE(bslice, nbtouse);
product = k_mul(a, bslice);
if (product == NULL)
goto fail;
return PyLong_FromLong(-MEDIUM_VALUE(v));
z = (PyLongObject *)_PyLong_Copy(v);
if (z != NULL)
- Py_SIZE(z) = -(Py_SIZE(v));
+ Py_SET_SIZE(z, -(Py_SIZE(v)));
return (PyObject *)z;
}
return NULL;
if (Py_SIZE(a) < 0) {
assert(Py_REFCNT(z) == 1);
- Py_SIZE(z) = -Py_SIZE(z);
+ Py_SET_SIZE(z, -Py_SIZE(z));
}
for (i = 0; i < wordshift; i++)
z->ob_digit[i] = 0;
/* Complement result if negative. */
if (negz) {
- Py_SIZE(z) = -(Py_SIZE(z));
+ Py_SET_SIZE(z, -(Py_SIZE(z)));
z->ob_digit[size_z] = PyLong_MASK;
v_complement(z->ob_digit, z->ob_digit, size_z+1);
}
T = -A; A = -B; B = T;
T = -C; C = -D; D = T;
}
- if (c != NULL)
- Py_SIZE(c) = size_a;
+ if (c != NULL) {
+ Py_SET_SIZE(c, size_a);
+ }
else if (Py_REFCNT(a) == 1) {
Py_INCREF(a);
c = a;
goto error;
}
- if (d != NULL)
- Py_SIZE(d) = size_a;
+ if (d != NULL) {
+ Py_SET_SIZE(d, size_a);
+ }
else if (Py_REFCNT(b) == 1 && size_a <= alloc_b) {
Py_INCREF(b);
d = b;
- Py_SIZE(d) = size_a;
+ Py_SET_SIZE(d, size_a);
}
else {
alloc_b = size_a;
return NULL;
}
assert(PyLong_Check(newobj));
- Py_SIZE(newobj) = Py_SIZE(tmp);
- for (i = 0; i < n; i++)
+ Py_SET_SIZE(newobj, Py_SIZE(tmp));
+ for (i = 0; i < n; i++) {
newobj->ob_digit[i] = tmp->ob_digit[i];
+ }
Py_DECREF(tmp);
return (PyObject *)newobj;
}
return -1;
}
- Py_SIZE(v) = size;
+ Py_SET_SIZE(v, size);
v->ob_digit[0] = (digit)abs(ival);
tstate->interp->small_ints[i] = v;
}
count++;
}
- if (count < PyList_GET_SIZE(pieces))
- Py_SIZE(pieces) = count;
+ if (count < PyList_GET_SIZE(pieces)) {
+ Py_SET_SIZE(pieces, count);
+ }
}
else {
PyObject *items = _PyObject_CallMethodIdNoArgs((PyObject *)self,
/* Always force the list to the expected size. */
-#define FIX_PREALLOC_SIZE(list) Py_SIZE(list) = count
+#define FIX_PREALLOC_SIZE(list) Py_SET_SIZE(list, count)
Py_LOCAL_INLINE(PyObject *)
STRINGLIB(split_whitespace)(PyObject* str_obj,
return NULL;
/* Hack the size of the variable object, so invisible fields don't appear
to Python code. */
- Py_SIZE(obj) = VISIBLE_SIZE_TP(type);
+ Py_SET_SIZE(obj, VISIBLE_SIZE_TP(type));
for (i = 0; i < size; i++)
obj->ob_item[i] = NULL;
*--sp = PyList_GET_ITEM(l, ll - j);
}
/* Resize the list. */
- Py_SIZE(l) = ll - argcntafter;
+ Py_SET_SIZE(l, ll - argcntafter);
Py_DECREF(it);
return 1;
return NULL;
}
- Py_SIZE(node) = size;
+ Py_SET_SIZE(node, size);
for (i = 0; i < size; i++) {
node->b_array[i] = NULL;
node->c_array[i] = NULL;
}
- Py_SIZE(node) = size;
+ Py_SET_SIZE(node, size);
node->c_hash = hash;
_PyObject_GC_TRACK(node);
if (ob == NULL)
return NULL;
- Py_SIZE(ob) = n > 0 ? size : -size;
+ Py_SET_SIZE(ob, n > 0 ? size : -size);
for (i = 0; i < size-1; i++) {
d = 0;