Title: Python 2.6.4 segfaults
Type: crash Stage:
Components: None Versions: Python 2.6
Status: closed Resolution: wont fix
Dependencies: Superseder:
Assigned To: Nosy List: mark.dickinson, ttsiod
Priority: normal Keywords:

Created on 2009-12-31 21:33 by ttsiod, last changed 2009-12-31 21:58 by mark.dickinson. This issue is now closed.

File name Uploaded Description Edit ttsiod, 2009-12-31 21:33 Sieve of Eratosthenes
Messages (2)
msg97109 - (view) Author: ttsiod (ttsiod) Date: 2009-12-31 21:33
I found a nice yield-based implementation of the sieve of Eratosthenes.

I tried to find the last prime number less than 1.000.000 (1M) - so I 
had to increase the recursion limit (via sys.setrecursionlimit).
It seemed to work - but after running for about 3 minutes, the
Python interpreter (2.6.4) crashed with a segmentation fault.

I am attaching the code - it uses no libraries except for "sys"
(it needs it to set the recursionlimit).
msg97110 - (view) Author: Mark Dickinson (mark.dickinson) * (Python committer) Date: 2009-12-31 21:58
The recursion limit exists precisely so that Python can avoid overflowing 
the C stack and hence crashing.  So if you increase the recursion limit 
without also increasing the stack space assigned to the process, you 
should expect a crash.

Closing as won't fix.
Date User Action Args
2009-12-31 21:58:44mark.dickinsonsetstatus: open -> closed

nosy: + mark.dickinson
messages: + msg97110

resolution: wont fix
2009-12-31 21:33:13ttsiodcreate