#7763: Resource limits for Haskell ---------------------------------+------------------------------------------ Reporter: ezyang | Owner: ezyang Type: feature request | Status: patch Priority: normal | Milestone: Component: Profiling | Version: 7.7 Keywords: | Os: Unknown/Multiple Architecture: Unknown/Multiple | Failure: None/Unknown Difficulty: Unknown | Testcase: Blockedby: | Blocking: Related: | ---------------------------------+------------------------------------------ Comment(by ezyang): Yes, I'm hoping Simon M will give a review; he looks pretty busy at the moment though. I worked very hard to keep the patch size small. I updated the wiki pages with the docs that I had in the base patch and a general introduction. There are definitely subtle interactions, but I believe that all of these subtle interactions already exist in the existing profiling semantics.
Plus, how the tricky problems are addressed? For example, when a data structure is shared between two resource-limited things, which does it get charged to, if either?
Perhaps it'd be worth emitting to Haskell Cafe the link to the design description, to encourage them to look at it, and take advantage of all
Just like how the original profiler works, the data structure is charged to the cost-centre that originally allocated it. This does mean you have to be careful about retainers; I’ll have some guidance on that soon. the smart people there? OK, sounds good; I originally sent an email to ghc-devs but Haskell Cafe will get a wider audience. -- Ticket URL: http://hackage.haskell.org/trac/ghc/ticket/7763#comment:4 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler