[issue23643] Segmentation Fault with Large Simple Function

Ned Deily added the comment: (Closed by submitter.) -- nosy: +ned.deily resolution: -> duplicate stage: -> resolved superseder: -> stack overflow evaluating eval("()" * 3) ___ Python tracker

[issue23643] Segmentation Fault with Large Simple Function

Changes by Brett Cannon : -- nosy: +brett.cannon ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscribe: https://mail.p

[issue23643] Segmentation Fault with Large Simple Function

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 func

[issue23643] Segmentation Fault with Large Simple Function

Changes by Michael Klein : -- status: open -> closed ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscribe: https://ma

[issue23643] Segmentation Fault with Large Simple Function

Changes by Ned Deily : -- components: -Macintosh ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscribe: https://mail.

[issue23643] Segmentation Fault with Large Simple Function

Changes by Ned Deily : -- nosy: -ned.deily ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscribe: https://mail.python

[issue23643] Segmentation Fault with Large Simple Function

Ned Deily added the comment: Isn't this a duplicate of Issue5765 and Issue11383? -- nosy: -ronaldoussoren ___ Python tracker ___ ___

[issue23643] Segmentation Fault with Large Simple Function

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

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

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 _

[issue23643] Segmentation Fault with Large Simple Function

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

Changes by Michael Klein : -- type: -> crash ___ Python tracker ___ ___ Python-bugs-list mailing list Unsubscribe: https://mail.pyth