New submission from Michael Klein:
I have gotten Segmentation Fault: 11 with the newest version of Python 2.7
and nothing but standard functions. The program is of the following form
(attached to this email):
def loopcountaux(a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14,
a15
Changes by Michael Klein michael14...@gmail.com:
--
type: - crash
___
Python tracker rep...@bugs.python.org
http://bugs.python.org/issue23643
___
___
Python-bugs-list
Michael Klein added the comment:
I found a simpler one, like Amaury's eval(+1 * 748580):
def f(x):
y = x+x+x+x+x
return y
print f(0)
(Except there are 74875 x+'s. This is exactly enough for a segfault, one less
runs fine.)
I've tried something like:
loopcount = 0
loopcount += (1
Changes by Michael Klein michael14...@gmail.com:
--
status: open - closed
___
Python tracker rep...@bugs.python.org
http://bugs.python.org/issue23643
___
___
Python-bugs
