#673: Import FastPackedStrings for 6.6
---+
Reporter: simonmar | Owner:
Type: task | Status: closed
Priority: high | Milestone: 6.6
#847: Threaded RTS problems on FreeBSD
---+
Reporter: simonmar|Owner: simonmar
Type: bug | Status: new
Priority: normal |Milestone: 6.4.3
Gregory Wright wrote:
Some additional information on the threading problems
experienced on FreeBSD. The system was FreeBSD 6.1-RELEASE-p2,
dual 2.8 GHz Xeon.
I built ghc-6.4.2 from cvs using the FreeBSD ports version of ghc-6.4.2.
(The latter has the threaded RTS disabled.) I ran the
#844: panic on conflicting patterns in TH splice
---+
Reporter: guest | Owner:
Type: bug | Status: closed
Priority: normal| Milestone:
#848: Threaded RTS problems on Solaris
---+
Reporter: simonmar|Owner:
Type: bug | Status: new
Priority: normal |Milestone: 6.4.3
Component:
#729: Build system uses wrong version of include files.
---+
Reporter: guest | Owner:
Type: bug | Status: closed
Priority: normal| Milestone:
#849: Offer control over branch prediction
+---
Reporter: simonpj |Owner:
Type: feature request | Status: new
Priority: normal |Milestone:
#850: threaded RTS uses SIGALRM
---+
Reporter: simonmar|Owner:
Type: bug | Status: new
Priority: normal |Milestone: 6.6.1
Component:
Hi Simon,
I'm sorry I don't have a test case, aside from what I've sent already,
and it's sometimes difficult to reproduce. (though note that the
GSLHaskell library can still be downloaded at the provided URL)
However, I've checked and double-checked our code and can't find
anything on our side
#281: Wrong overlapped/missing pattern warnings
---+
Reporter: nobody| Owner: nobody
Type: bug | Status: closed
Priority: lowest| Milestone:
Component: Compiler
#852: Browsing a module in ghci can cause a panic
-+--
Reporter: mnislaih |Owner:
Type: bug | Status: new
Priority: normal|Milestone: 6.6
#852: Browsing a module in ghci can cause a panic
--+-
Reporter: mnislaih | Owner:
Type: bug | Status: new
Priority: normal |
...
here3
here4 [ here it hangs and i press ^C ]
runghc: waitForProcess: interrupted (Interrupted system call)
...
Ah yes, this is because GHCi isn't compiled with -threaded. Looks
like we've found one more reason to do that.
Can I compile ghci with -threaded myself? Or is there a
Rich Fought wrote:
I'm still chasing down a memory leak in my server application written in
Haskell using GHC 6.4.x under MinGW/MSYS. In the scenario described
below, I am repeating the same server request once per second continuously.
After utilizing some memory monitoring tools I've
Simon Peyton-Jones wrote:
By this code is currently broken, I'm sure you are right, but which
code you mean exactly? The Win32 binding for GHC? Or the Hugs Graphics
Library (HGL) implementation for GHC?
It'd be good to have a Trac bug report, specifying as precisely as
possible what is
Vyacheslav Akhmechet wrote:
I apologize if this question has been asked before, but I couldn't
find an FAQ or the answer online.
Does Visual Haskell have support for evaluating expressions? I tried a
few things (like highlighting an expression, rightclicking, and
looking for evaluate option)
Simon Marlow wrote:
Chris Kuklewicz wrote:
Would a new and expanded Regex package (Test.Regex.Lazy) be something
that could be included in the 6.6.0 libraries? What is the best
practice for getting it included?
Since we're aiming to include fewer libraries under the GHC umbrella,
not more,
Chris Kuklewicz wrote:
That could work well. It would not involved too much pulling apart.
Once small quirk is there is the old Text.Regex API and a new
JRegex-style API.
Is it possible to provide both? Perhaps deprecating the current API?
A default backend has to be dependably present.
Simon Marlow wrote:
Chris Kuklewicz wrote:
That could work well. It would not involved too much pulling apart.
Once small quirk is there is the old Text.Regex API and a new
JRegex-style API.
Is it possible to provide both? Perhaps deprecating the current API?
It is possible to provide
So now that GHC is so good at producing really fast low level code (see
ByteString benchmarks) we start to encounter low level gubbins where to
get the fastest possible code we need slightly more influence over
branch prediction.
In the code for ByteString's 'writeStrUp/Dn' functions we're doing
$ghc-pkg --where-from ParseError
package parsec: defining modules: Text.ParserCombinators.Parsec.Error,
Text.ParserCombinators.Parsec
?
This is what I've done by now... It took me some days to notice that the
./ghc-pkg symlinks to ghc-pkg-6.5 which calls the ghc-pkg from /usr/lib/...
Simon Marlow wrote:
What tool(s) did you use to obtain this figure?
This particular figure was gathered using perfmon logs collecting once
per second from my application, while running in WinDbg to break on
getMBlocks(). The particular memory variables tracked are Private
Bytes and
Simon Marlow wrote:
An update on the GHC/FreeBSD front: I didn't manage to reproduce the
reported threading bugs on a UP, will be trying on a MP shortly.
Using -lthr instead of -pthread, I completed a test run on the dual proc box:
OVERALL SUMMARY for test run started at Tue Aug 8 09:21:49
(when (compilesOk) (announce newVersion))
This is a development release announcement of TextRegexLazy
The TextRegexLazy package is dead.
Long Live [regex-base -- interfaces
,regex-compat -- replace Text.Regex
,regex-posix-- PosixRE backend
,regex-pcre
I want to modify jhc to take advantage of mutiple CPUs to help mitigate
its prodigious computational requirements and was curious how well ghc
compiled programs deal with forking?
my initial plan is that once jhc determines which modules need to be
recompiled, it will fork(2) off processes down
I was wondering if we could be sure to get
dependingOn :: a - b - a
dependingOn =
in ghc 6.6? this has been discussed before, it is implemented in jhc and
I have found all sorts of use for it as it can be used to control let
floating and inlining in a nice general way and is trivial to
Hi,
I've been using ghc on Mac OS X for a while now, so when I noticed
Simon Marlow's call (made last month, but I just noticed it) for people
to help with OS X, I thought, why not?
Well, it turns out that I can't even build ghc, so I'm not likely to
end up being much help. But it would be
Hello Ki,
Tuesday, August 8, 2006, 6:34:51 AM, you wrote:
Unfortunately seq and the strict data declaration is not helpful in general.
They are only helpful on base values such as Int or Bool.
What they do is just making sure that it is not a thunk.
That is if it was a list it would just
Hi Simon,
It is good that you support thread-local variables.
I have initialized a wiki page:
http://haskell.org/haskellwiki/Thread_local_storage
The main difference between my and your proposals, as I see it, is
that your proposal is based on keys which can be used for other
things.
I think
On 07.08 13:16, Frederik Eaton wrote:
How would this work together with the FFI?
It wouldn't, at least I wouldn't care if it didn't.
Suddenly breaking libraries that happen to use FFI behind your
back does not seem like a good conservative extension.
I think we should move the discussion
On Tue, Aug 08, 2006 at 04:21:06PM +0300, Einar Karttunen wrote:
On 07.08 13:16, Frederik Eaton wrote:
How would this work together with the FFI?
It wouldn't, at least I wouldn't care if it didn't.
Suddenly breaking libraries that happen to use FFI behind your
back does not seem like
Furthermore, can we move this thread from the Haskell mailing list
(which should not have heavy traffic) to either Haskell-Café, or
the libraries list?
Sure, moving to haskell-cafe.
Frederik
--
http://ofb.net/~frederik/
___
Haskell mailing list
line 39 works fine
line 56 doesn't. Why?
Isn't both a IO monad (because of the print statements)
After commenting out 56 it compiles fine
Any suggestion appreciated.. I'm struggling for some hours now..
module Modules.ObjectTree where
import Debug.Trace
import Data.FunctorM
import DBUtils
Reilly Hayes [EMAIL PROTECTED] writes:
On Aug 7, 2006, at 10:00 AM, Stefan Monnier wrote:
In any case, making a living by selling a program (as opposed to services
around that program) is a difficult business.
Making a living writing and selling programs for use by a wide audience
Hello Ki,
Tuesday, August 8, 2006, 6:34:51 AM, you wrote:
Unfortunately seq and the strict data declaration is not helpful in general.
They are only helpful on base values such as Int or Bool.
What they do is just making sure that it is not a thunk.
That is if it was a list it would just
Ahn, Ki Yung wrote:
Recently, I'm facing the dark side of laziness
-- the memory leak because of laziness.
Typical pattern that I encounter the problem is like this.
My code was working fine and I was happy.
I just wanted to inspect some properties of my code so
I made a slight chage go the
Hi
I've tried as an exercise to learn how to use the state monad to create
a tree this way:
module Main where
import Control.Monad.State
import Data.Tree
import Random
createTree :: Int - Int - (Tree Int, Int)
createTree 4 = runState $ State $ \s - (Node s [] , s+1) -- stop at level 4
Is there a better way to do this?
This problem is similar to adding numbers to each tree item
Marc
Yes. The feature you wanted is replicateM.
The point of a State monad is you probably never have to touch the State data
constructor:
module Main where
import Control.Monad.State
import
Ahn, Ki Yung wrote:
Recently, I'm facing the dark side of laziness
-- the memory leak because of laziness.
Are there standardized approaches for detecting and fixing
these kind of problems?
Not really. As Don S. already said, try heap profiling. The function
that is too lazy will show up
Marc Weber wrote:
I've tried as an exercise to learn how to use the state monad to create
a tree this way:
createTree :: Int - Int - (Tree Int, Int)
createTree 4 = runState $ State $ \s - (Node s [] , s+1) -- stop at level 4
createTree level = runState (do item - State $ (\s - (s,s+1))
| I have initialized a wiki page:
|
| http://haskell.org/haskellwiki/Thread_local_storage
Great
| I have put a page on the wiki summarizing the thread. However, I want
| to say that I think that email is a better medium for most ongoing
| discussions.
I agree.
Discussion by email
Furthermore, can we move this thread from the Haskell mailing list
(which should not have heavy traffic) to either Haskell-Café, or
the libraries list?
Sure, moving to haskell-cafe.
Frederik
--
http://ofb.net/~frederik/
___
Haskell-Cafe mailing
On Tue, Aug 08, 2006 at 02:30:39PM +0200, Marc Weber wrote:
Is there a better way to do this?
In this case it is quite easy to separate the task into two smaller
ones:
- creating the tree with a desired shape
- numbering the nodes in post-order
The first task is naturally expressed without
Thanks to you all!
I think I've learned a lot.
Marc
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
The HWS - With Plugins tarball is unavailable at the author's website
(http://www.mdstud.chalmers.se/~md9ms/hws-wp/) and his email address
doesn't work so this is desperate attempt to reach him. So, Martin
Sjögren, are you here somewhere?
P.S. If someone else knows where I could get hold of the
Brian Hulley [EMAIL PROTECTED] writes:
Also, the bottom line imho is that Haskell is a difficult language to
understand, and this is compounded by the apparent cleverness of
unreadable code like:
c = (.) . (.)
when a normal person would just write:
c f g a b = f (g a b)
All
Hello,
as a haskell newbie I'm wondering about the following question.
Are there options to popular haskell implementations or other means
(haskell lint?) to check for incomplete patterns at compile time for
some? I can't see a reason why this shouldn't be possible or even a
relatively
The ghc flag -fwarn-incomplete-patterns might be what you're looking for.
/g
On 8/8/06, Jens Theisen [EMAIL PROTECTED] wrote:
Hello,
as a haskell newbie I'm wondering about the following question.
Are there options to popular haskell implementations or other means
(haskell lint?) to check
jens-theisen-tmp01:
Hello,
as a haskell newbie I'm wondering about the following question.
Are there options to popular haskell implementations or other means
(haskell lint?) to check for incomplete patterns at compile time for
some? I can't see a reason why this shouldn't be possible
On Aug 8, 2006, at 1:42 AM, Immanuel Litzroth wrote:"Reilly Hayes" [EMAIL PROTECTED] writes: I don't understand your argument. How exactly does the GPL get in theway of selling software as an instantiation of business expertise?Are you saying that you have the business expertise but
50 matches
Mail list logo
