#14854: The size of FastString table is suboptimal for large codebases -------------------------------------+------------------------------------- Reporter: niteria | Owner: (none) Type: bug | Status: new Priority: normal | Milestone: Component: Compiler | Version: Resolution: | Keywords: Operating System: Unknown/Multiple | Architecture: Type of failure: Compile-time | Unknown/Multiple performance bug | Test Case: Blocked By: | Blocking: Related Tickets: | Differential Rev(s): Wiki Page: | -------------------------------------+------------------------------------- Comment (by simonmar):
3,106,526,336 bytes maximum residency (8 sample(s))
:-o What's the residency overhead for the larger hash table? I suppose this hash table should auto-grow and rehash itself, unless there's not much overhead for the larger table. One stopgap approach might be to have a command-line flag to set the size. It would have to be a static flag though (yuck). -- Ticket URL: http://ghc.haskell.org/trac/ghc/ticket/14854#comment:5 GHC http://www.haskell.org/ghc/ The Glasgow Haskell Compiler