}
LOCAL(int)
-element_resize(ElementObject* self, int extra)
+element_resize(ElementObject* self, Py_ssize_t extra)
{
- int size;
+ Py_ssize_t size;
PyObject* *children;
/* make sure self->children can hold the given number of extra
* be safe.
*/
size = size ? size : 1;
+ if ((size_t)size > PY_SSIZE_T_MAX/sizeof(PyObject*))
+ goto nomemory;
+ if (size > INT_MAX) {
+ PyErr_SetString(PyExc_OverflowError,
+ "too many children");
+ return -1;
+ }
if (self->extra->children != self->extra->_children) {
/* Coverity CID #182 size_error: Allocating 1 bytes to pointer
* "children", which needs at least 4 bytes. Although it's a
PyObject *tail,
PyObject *children)
{
- Py_ssize_t i, nchildren;
+ int i, nchildren;
if (!tag) {
PyErr_SetString(PyExc_TypeError, "tag may not be NULL");
/* Compute 'nchildren'. */
if (children) {
+ Py_ssize_t size;
if (!PyList_Check(children)) {
PyErr_SetString(PyExc_TypeError, "'_children' is not a list");
return NULL;
}
- nchildren = PyList_Size(children);
+ size = PyList_Size(children);
+ /* expat limits nchildren to int */
+ if (size > INT_MAX) {
+ PyErr_SetString(PyExc_OverflowError, "too many children");
+ return NULL;
+ }
+ nchildren = (int)size;
}
else {
nchildren = 0;
}
static int
-element_setitem(PyObject* self_, Py_ssize_t index, PyObject* item)
+element_setitem(PyObject* self_, Py_ssize_t index_, PyObject* item)
{
ElementObject* self = (ElementObject*) self_;
- int i;
+ int i, index;
PyObject* old;
- if (!self->extra || index < 0 || index >= self->extra->length) {
+ if (!self->extra || index_ < 0 || index_ >= self->extra->length) {
PyErr_SetString(
PyExc_IndexError,
"child assignment index out of range");
return -1;
}
+ index = (int)index_;
old = self->extra->children[index];
&start, &stop, &step, &slicelen) < 0) {
return -1;
}
+ assert(slicelen <= self->extra->length);
if (value == NULL) {
/* Delete slice */
(self->extra->length - cur) * sizeof(PyObject *));
}
- self->extra->length -= slicelen;
+ self->extra->length -= (int)slicelen;
/* Discard the recycle list with all the deleted sub-elements */
Py_XDECREF(recycle);
return -1;
}
}
+ assert(newlen - slicelen <= INT_MAX - self->extra->length);
+ assert(newlen - slicelen >= -self->extra->length);
if (slicelen > 0) {
/* to avoid recursive calls to this method (via decref), move
self->extra->children[cur] = element;
}
- self->extra->length += newlen - slicelen;
+ self->extra->length += (int)(newlen - slicelen);
Py_DECREF(seq);
break;
}
+ if (PyBytes_GET_SIZE(buffer) > INT_MAX) {
+ Py_DECREF(buffer);
+ Py_DECREF(reader);
+ PyErr_SetString(PyExc_OverflowError, "size does not fit in an int");
+ return NULL;
+ }
res = expat_parse(
- self, PyBytes_AS_STRING(buffer), PyBytes_GET_SIZE(buffer), 0
+ self, PyBytes_AS_STRING(buffer), (int)PyBytes_GET_SIZE(buffer), 0
);
Py_DECREF(buffer);