2010/8/17 Gregory Collins g...@gregorycollins.net:
Does GHC expose any primitives for things like atomic compare-and-swap?
I think that STM could qualify as LL/SC.
It does LL with TVars and bulk SC with transaction commit. ;)
___
Haskell-Cafe mailing
Hello all,
Does GHC expose any primitives for things like atomic compare-and-swap?
I can't seem to find anything in the docs. I'm wondering if it's
possible, for example, to implement things like the wait-free concurrent
queue from [1] or a lock-free wait-free hash table like the Azul people
are