Serhiy Storchaka <storchaka+cpyt...@gmail.com> added the comment:

In this particular case unmarshalling creates a tuple containing a reference to 
itself which is used as a key in a dict. Calculating a hash of such tuple leads 
to infinite recursion which overflows the programming stack. There is no 
efficient way to detect such case, and since cyclic tuples cannot be created by 
pure Python code we should not even try to solve this problem. You can get it 
only by misusing the C API or the ctypes module or loading invalid marshal data.

----------
resolution:  -> not a bug
stage:  -> resolved
status: open -> closed

_______________________________________
Python tracker <rep...@bugs.python.org>
<https://bugs.python.org/issue41208>
_______________________________________
_______________________________________________
Python-bugs-list mailing list
Unsubscribe: 
https://mail.python.org/mailman/options/python-bugs-list/archive%40mail-archive.com

Reply via email to