Skip to content

bpo-38525: Fix a segmentation fault when using reverse iterators of empty dict #16846

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 8 commits into from
Oct 19, 2019
Merged
Show file tree
Hide file tree
Changes from 2 commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
13 changes: 13 additions & 0 deletions Lib/test/test_dict.py
Original file line number Diff line number Diff line change
Expand Up @@ -1312,6 +1312,19 @@ def test_reversed(self):
self.assertEqual(list(r), list('dcba'))
self.assertRaises(StopIteration, next, r)

def test_reverse_iterator_for_empty_dict(self):
empty_dict = {}
self.assertEqual(list(reversed(empty_dict)), [])
self.assertEqual(list(reversed(empty_dict.items())), [])
self.assertEqual(list(reversed(empty_dict.values())), [])
self.assertEqual(list(reversed(empty_dict.keys())), [])

empty_dict = dict()
self.assertEqual(list(reversed(empty_dict)), [])
self.assertEqual(list(reversed(empty_dict.items())), [])
self.assertEqual(list(reversed(empty_dict.values())), [])
self.assertEqual(list(reversed(empty_dict.keys())), [])

def test_dict_copy_order(self):
# bpo-34320
od = collections.OrderedDict([('a', 1), ('b', 2)])
Expand Down
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
Fix a segmentation fault when using reverse iterators of empty ``dict``
objects that were created as empty ``dict`` literals. Patch by Dong-hee Na.
2 changes: 1 addition & 1 deletion Objects/dictobject.c
Original file line number Diff line number Diff line change
Expand Up @@ -3826,7 +3826,7 @@ dictreviter_iternext(dictiterobject *di)
PyObject *key, *value, *result;

if (d->ma_values) {
if (i < 0) {
if (i < 0 || i >= d->ma_used) {
goto fail;
}
key = DK_ENTRIES(k)[i].me_key;
Expand Down