[GHC] #7670: StablePtrs should be organized by generation for efficient minor collections

[GHC]

#7670: StablePtrs should be organized by generation for efficient minor
collections
-----------------------------+----------------------------------------------
Reporter:  ezyang            |          Owner:                  
    Type:  bug               |         Status:  new             
Priority:  normal            |      Component:  Runtime System  
 Version:  7.7               |       Keywords:                  
      Os:  Unknown/Multiple  |   Architecture:  Unknown/Multiple
 Failure:  None/Unknown      |      Blockedby:                  
Blocking:                    |        Related:                  
-----------------------------+----------------------------------------------
 Currently, stable pointers are all in one giant pointer table (see
 markStablePtrTable); this results in pretty bad GC behavior when you
 create a lot of stable pointers (Peaker has a test-case which he thinks is
 suffering due to repeated traversal of the stable pointers list.) We
 should partition them up into generations like we do for mutable lists.
 There might be some trickiness keeping the table up-to-date after GCs.

-- 
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/7670>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler