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

#7670: StablePtrs should be organized by generation for efficient minor collections -------------------------------------+------------------------------------- Reporter: ezyang | Owner: (none) Type: bug | Status: new Priority: normal | Milestone: Component: Runtime System | Version: 7.7 Resolution: | Keywords: Operating System: Unknown/Multiple | Architecture: | Unknown/Multiple Type of failure: None/Unknown | Test Case: Blocked By: | Blocking: Related Tickets: | Differential Rev(s): Wiki Page: | -------------------------------------+------------------------------------- Comment (by dfeuer): There's another way to go "generational" that takes into account the fact that (I imagine) stable names tend to live a long time. We could have just one hash table, but also keep a list of all the stable names whose underlying objects are in the nursery. When we perform a minor collection, we go through that list and delete the dead. -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/7670#comment:21 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler
participants (1)
-
GHC