items = self->ob_item;
for (i = n; --i >= where; )
items[i+1] = items[i];
- Py_INCREF(v);
- items[where] = v;
+ items[where] = Py_NewRef(v);
return 0;
}
PyList_Append(PyObject *op, PyObject *newitem)
{
if (PyList_Check(op) && (newitem != NULL)) {
- Py_INCREF(newitem);
- return _PyList_AppendTakeRef((PyListObject *)op, newitem);
+ return _PyList_AppendTakeRef((PyListObject *)op, Py_NewRef(newitem));
}
PyErr_BadInternalCall();
return -1;
PyErr_SetObject(PyExc_IndexError, &_Py_STR(list_err));
return NULL;
}
- Py_INCREF(a->ob_item[i]);
- return a->ob_item[i];
+ return Py_NewRef(a->ob_item[i]);
}
static PyObject *
dest = np->ob_item;
for (i = 0; i < len; i++) {
PyObject *v = src[i];
- Py_INCREF(v);
- dest[i] = v;
+ dest[i] = Py_NewRef(v);
}
Py_SET_SIZE(np, len);
return (PyObject *)np;
dest = np->ob_item;
for (i = 0; i < Py_SIZE(a); i++) {
PyObject *v = src[i];
- Py_INCREF(v);
- dest[i] = v;
+ dest[i] = Py_NewRef(v);
}
src = b->ob_item;
dest = np->ob_item + Py_SIZE(a);
for (i = 0; i < Py_SIZE(b); i++) {
PyObject *v = src[i];
- Py_INCREF(v);
- dest[i] = v;
+ dest[i] = Py_NewRef(v);
}
Py_SET_SIZE(np, size);
return (PyObject *)np;
}
for (k = 0; k < n; k++, ilow++) {
PyObject *w = vitem[k];
- Py_XINCREF(w);
- item[ilow] = w;
+ item[ilow] = Py_XNewRef(w);
}
for (k = norig - 1; k >= 0; --k)
Py_XDECREF(recycle[k]);
{
Py_ssize_t input_size = PyList_GET_SIZE(self);
if (input_size == 0 || n == 1) {
- Py_INCREF(self);
- return (PyObject *)self;
+ return Py_NewRef(self);
}
if (n < 1) {
(void)_list_clear(self);
- Py_INCREF(self);
- return (PyObject *)self;
+ return Py_NewRef(self);
}
if (input_size > PY_SSIZE_T_MAX / n) {
_Py_memory_repeat((char *)items, sizeof(PyObject *)*output_size,
sizeof(PyObject *)*input_size);
- Py_INCREF(self);
- return (PyObject *)self;
+ return Py_NewRef(self);
}
static int
}
if (v == NULL)
return list_ass_slice(a, i, i+1, v);
- Py_INCREF(v);
- Py_SETREF(a->ob_item[i], v);
+ Py_SETREF(a->ob_item[i], Py_NewRef(v));
return 0;
}
dest = self->ob_item + m;
for (i = 0; i < n; i++) {
PyObject *o = src[i];
- Py_INCREF(o);
- dest[i] = o;
+ dest[i] = Py_NewRef(o);
}
Py_DECREF(iterable);
Py_RETURN_NONE;
if (result == NULL)
return result;
Py_DECREF(result);
- Py_INCREF(self);
- return (PyObject *)self;
+ return Py_NewRef(self);
}
/*[clinic input]
}
PyMem_Free(final_ob_item);
}
- Py_XINCREF(result);
- return result;
+ return Py_XNewRef(result);
}
#undef IFLT
#undef ISLT
dest = ((PyListObject *)result)->ob_item;
for (cur = start, i = 0; i < slicelength;
cur += (size_t)step, i++) {
- it = src[cur];
- Py_INCREF(it);
+ it = Py_NewRef(src[cur]);
dest[i] = it;
}
Py_SET_SIZE(result, slicelength);
for (cur = start, i = 0; i < slicelength;
cur += (size_t)step, i++) {
garbage[i] = selfitems[cur];
- ins = seqitems[i];
- Py_INCREF(ins);
+ ins = Py_NewRef(seqitems[i]);
selfitems[cur] = ins;
}
if (it == NULL)
return NULL;
it->it_index = 0;
- Py_INCREF(seq);
- it->it_seq = (PyListObject *)seq;
+ it->it_seq = (PyListObject *)Py_NewRef(seq);
_PyObject_GC_TRACK(it);
return (PyObject *)it;
}
if (it->it_index < PyList_GET_SIZE(seq)) {
item = PyList_GET_ITEM(seq, it->it_index);
++it->it_index;
- Py_INCREF(item);
- return item;
+ return Py_NewRef(item);
}
it->it_seq = NULL;
return NULL;
assert(PyList_Check(self));
it->it_index = PyList_GET_SIZE(self) - 1;
- Py_INCREF(self);
- it->it_seq = self;
+ it->it_seq = (PyListObject*)Py_NewRef(self);
PyObject_GC_Track(it);
return (PyObject *)it;
}
if (index>=0 && index < PyList_GET_SIZE(seq)) {
item = PyList_GET_ITEM(seq, index);
it->it_index--;
- Py_INCREF(item);
- return item;
+ return Py_NewRef(item);
}
it->it_index = -1;
it->it_seq = NULL;