On 28/05/2014 12:16, Edward Kmett wrote:
How hard /would/ it be to replace the global weak pointer lock with
something that scales better?
I'm looking at switching some of my older BDD code into Haskell.
To do so I'd love to be able to use an intuitive weak-pointer based
cache management
I actually don't know that it would be the bottleneck if I ported it to
Haskell at this time, as lots of other things will change speed, and I may
lose for other reasons: The memory layout is less efficient, the cache
management overhead is higher, etc.
I do know that if I were to reintroduced a
How hard *would* it be to replace the global weak pointer lock with
something that scales better?
I'm looking at switching some of my older BDD code into Haskell.
To do so I'd love to be able to use an intuitive weak-pointer based cache
management scheme, but I have to confess the notion of a
Yes, this should be easy to fix, it just hasn't been done.
Edward
Excerpts from Carter Schonwald's message of 2014-05-28 11:21:30 -0700:
@Edwardk, ezyang has a ticket on this very topic!
https://ghc.haskell.org/trac/ghc/ticket/9075
(is that what you're thinking?)
On Wed, May 28, 2014 at
