Segmentation fault in GHC compiled program

[Martin Böhme]

Dear GHC team,

While testing Martin Erwig's functional graph library, I encountered
what I believe is a bug in GHC. My test program crashes with a
segmentation fault for graphs above a certain size. Here are my answers
to the questions in the bug-reporting section of the documentation:

1. I'm using SuSE 6.4 on an AMD K6 200 MHz machine with 64 MB RAM. uname
   -a says

   Linux linux1 2.2.14 #1 Mon Mar 13 10:51:48 GMT 2000 i586 unknown

2. I'm using gcc version 2.95.2 19991024

3. The output which results from running the makefile is included in the
   TGZ as "makefile_output".

5. Run the program, enter the desired number of knots in the graph, then
   press Enter. The program will peform a DFS on the graph. On my
   machine, it will run for 5000 nodes but crash for 10000 nodes.

6. I'm including the complete set of files needed to compile the
   program. Run make and the program will be generated.

Hope this helps...

Martin Boehme
-------------- next part --------------
A non-text attachment was scrubbed...
Name: Ghc_bug.tgz
Type: application/x-compressed
Size: 27077 bytes
Desc: not available
Url : http://www.haskell.org/pipermail/glasgow-haskell-bugs/attachments/20001016/7f1cccdd/Ghc_bug.bin