Changes between Initial Version and Version 1 of Ticket #9429, comment 13


Ignore:
Timestamp:
Aug 13, 2014 4:09:16 PM (5 years ago)
Author:
rrnewton
Comment:

Legend:

Unmodified
Added
Removed
Modified
  • Ticket #9429, comment 13

    initial v1  
    11Hi all,
    22
    3 Uh uh!  Our approach to lock-free data structures in Haskell (atomic-primops, chaselev-deque, lockfree-queue, concurrent-skiplist) is based on `Any`.
     3Uh oh!  Our approach to lock-free data structures in Haskell (atomic-primops, chaselev-deque, lockfree-queue, concurrent-skiplist) is based on `Any`.
    44
    55The way we use Any is simply to prevent GHC from performing any optimizations that change the pointer identity of the object.  That is, the "Ticket" type in atomic-primops is really just an Any.  Is there some other way to accomplish this goal via other means in GHC head?  Perhaps we need something like NOINLINE...