-fvia-C for libHSbase, etc.?

2008-06-04 Thread Donn Cave
I'm building GHC on NetBSD-amd64, and among other things need to deal with the problem described in #2305 - native code misses the __RENAME (__asm) directive in NetBSD include files, and ends up linking to the wrong externals. The author of #2305 reports that -fvia-C avoids this problem, so I buil

Re: GHC 6.8.2 and large source files

2008-06-04 Thread Christian Höner zu Siederdissen
Dear Haskell users, please see ticket 2346 for example code. Note that two of the files will likely require all available memory upon compilation. Christian Höner zu Siederdissen * Christian Höner zu Siederdissen <[EMAIL PROTECTED]> [01.01.1970 00:59]: > Dear Haskell users, > > we have an autom

Re: Having trouble with parallel Haskell

2008-06-04 Thread Bryan O'Sullivan
Albert Y. C. Lai wrote: > In main, the builder of input is highly lazy, since randoms is. To be > sure, the spine of the list is presently forced by printing its length, > but the numbers inside the list... It is very bleak because randoms > ensures that input!!(n+1) is patently dependent on input

Re: Having trouble with parallel Haskell

2008-06-04 Thread Bryan O'Sullivan
Isaac Dupree wrote: > (no idea if that's relevant, though) I can't tell either. It doesn't seem to make a difference, at any rate. By the way, I notice that the threaded RTS blocks signals for long periods of time when I run this program. If I hit control-C, it takes several seconds for the pr

Re: Having trouble with parallel Haskell

2008-06-04 Thread Don Stewart
trebla: > I do not have a platform to try it on; the following is pure speculation. > > In main, the builder of input is highly lazy, since randoms is. To be > sure, the spine of the list is presently forced by printing its length, > but the numbers inside the list... It is very bleak because ra

Re: Having trouble with parallel Haskell

2008-06-04 Thread Albert Y. C. Lai
I do not have a platform to try it on; the following is pure speculation. In main, the builder of input is highly lazy, since randoms is. To be sure, the spine of the list is presently forced by printing its length, but the numbers inside the list... It is very bleak because randoms ensures th

Re: Having trouble with parallel Haskell

2008-06-04 Thread Isaac Dupree
Bryan O'Sullivan wrote: | otherwise = rnf lesser `par` (rnf greater `pseq` lesser ++ x:greater) It seems that `pseq` doesn't have a defined precedence, so it's infixl 9, unlike `seq` and `par` which are infixr 0. Therefore the above is equivalent to | otherwise = rnf le

Having trouble with parallel Haskell

2008-06-04 Thread Bryan O'Sullivan
I intended to write a half chapter or so about parallel programming in Haskell for the book I'm working on, but I've been coming to the conclusion that the time is not yet ripe for this. I hope it will be helpful if I share my experiences here. Specifically, I was planning to write about parallel