[issue23643] Segmentation Fault with Large Simple Function

2015-03-13 Thread Ned Deily
Ned Deily added the comment: (Closed by submitter.) -- nosy: +ned.deily resolution: - duplicate stage: - resolved superseder: - stack overflow evaluating eval(() * 3) ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue23643

[issue23643] Segmentation Fault with Large Simple Function

2015-03-13 Thread Brett Cannon
Changes by Brett Cannon br...@python.org: -- nosy: +brett.cannon ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue23643 ___ ___ Python-bugs-list

[issue23643] Segmentation Fault with Large Simple Function

2015-03-12 Thread Amaury Forgeot d'Arc
Amaury Forgeot d'Arc added the comment: So the recursion crash was fixed in python3, but it's still one of the limits of the Python AST compiler. I suggest to replace your long expression by a list: exprs = [(1-a36)*(a37)*(1-a41), (a22)*(a33)*(1-a23), ...] return sum(exprs) ...but this

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread Ned Deily
Changes by Ned Deily n...@acm.org: -- nosy: -ned.deily ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue23643 ___ ___ Python-bugs-list mailing list

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread Ned Deily
Ned Deily added the comment: Isn't this a duplicate of Issue5765 and Issue11383? -- nosy: -ronaldoussoren ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue23643 ___

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread Ned Deily
Changes by Ned Deily n...@acm.org: -- components: -Macintosh ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue23643 ___ ___ Python-bugs-list mailing

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread Michael Klein
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,

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread Michael Klein
Changes by Michael Klein michael14...@gmail.com: -- type: - crash ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue23643 ___ ___ Python-bugs-list

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread Michael Klein
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 +=

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread Amaury Forgeot d'Arc
Amaury Forgeot d'Arc added the comment: Probably a stack overflow, when the AST is too deep: eval(+1 * 748580) also crashed for me -- nosy: +amaury.forgeotdarc ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue23643

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread SilentGhost
SilentGhost added the comment: This seems to work on linux (returning 0), but fails on 3.4 with RuntimeError: maximum recursion depth exceeded during compilation. I wonder if the two are related. -- nosy: +SilentGhost ___ Python tracker

[issue23643] Segmentation Fault with Large Simple Function

2015-03-11 Thread Michael Klein
Changes by Michael Klein michael14...@gmail.com: -- status: open - closed ___ Python tracker rep...@bugs.python.org http://bugs.python.org/issue23643 ___ ___