Python 2.6.4 segfaults

[ttsiod]

BPO	7614
Nosy	@mdickinson
Files	sieve.py: Sieve of Eratosthenes

^{Note: these values reflect the state of the issue at the time it was migrated and might not reflect the current state.}

Show more details

GitHub fields:

assignee = None
closed_at = <Date 2009-12-31.21:58:44.242>
created_at = <Date 2009-12-31.21:33:13.038>
labels = ['type-crash']
title = 'Python 2.6.4 segfaults'
updated_at = <Date 2009-12-31.21:58:44.216>
user = 'https://bugs.python.org/ttsiod'

bugs.python.org fields:

activity = <Date 2009-12-31.21:58:44.216>
actor = 'mark.dickinson'
assignee = 'none'
closed = True
closed_date = <Date 2009-12-31.21:58:44.242>
closer = 'mark.dickinson'
components = ['None']
creation = <Date 2009-12-31.21:33:13.038>
creator = 'ttsiod'
dependencies = []
files = ['15714']
hgrepos = []
issue_num = 7614
keywords = []
message_count = 2.0
messages = ['97109', '97110']
nosy_count = 2.0
nosy_names = ['mark.dickinson', 'ttsiod']
pr_nums = []
priority = 'normal'
resolution = 'wont fix'
stage = None
status = 'closed'
superseder = None
type = 'crash'
url = 'https://bugs.python.org/issue7614'
versions = ['Python 2.6']

[ttsiod]

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).

[mdickinson]

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.