diff options
| author | sth <sth.dev@tejp.de> | 2019-01-02 02:01:54 (GMT) |
|---|---|---|
| committer | Benjamin Peterson <benjamin@python.org> | 2019-01-02 02:01:54 (GMT) |
| commit | f8b534477a2a51d85ea1663530f685f805f2b247 (patch) | |
| tree | 4451d5f9b3737e1bedb15f445ba10e3f2e8de007 /Objects/listobject.c | |
| parent | 7e3fb40b923cb09ecc67816d3191197868593737 (diff) | |
| download | cpython-f8b534477a2a51d85ea1663530f685f805f2b247.zip cpython-f8b534477a2a51d85ea1663530f685f805f2b247.tar.gz cpython-f8b534477a2a51d85ea1663530f685f805f2b247.tar.bz2 | |
closes bpo-35623: Fix integer overflow when sorting large lists (GH-11380)
There is already a `Py_ssize_t i` defined at function scope that is used
for similar loops. By removing the local `int i` declaration that `i` is
used, which has the appropriate type.
Diffstat (limited to 'Objects/listobject.c')
| -rw-r--r-- | Objects/listobject.c | 1 |
1 files changed, 0 insertions, 1 deletions
diff --git a/Objects/listobject.c b/Objects/listobject.c index 17c37ba..e11a3fd 100644 --- a/Objects/listobject.c +++ b/Objects/listobject.c @@ -2283,7 +2283,6 @@ list_sort_impl(PyListObject *self, PyObject *keyfunc, int reverse) int ints_are_bounded = 1; /* Prove that assumption by checking every key. */ - int i; for (i=0; i < saved_ob_size; i++) { if (keys_are_in_tuples && |