#4856: Performance regression in the type checker regression for GADTs and type
families
----------------------------------------+-----------------------------------
Reporter: chak | Owner:
Type: bug | Status: new
Priority: high | Milestone: 7.0.3
Component: Compiler (Type checker) | Version: 7.0.1
Keywords: | Testcase:
Blockedby: | Difficulty:
Os: Unknown/Multiple | Blocking:
Architecture: Unknown/Multiple | Failure: Compile-time
performance bug
----------------------------------------+-----------------------------------
Changes (by simonpj):
* cc: dimit...@… (added)
Comment:
OK after this commit
{{{
Wed Jan 12 06:56:04 PST 2011 [email protected]
* Major refactoring of the type inference engine
This patch embodies many, many changes to the contraint solver, which
make it simpler, more robust, and more beautiful. But it has taken
me ages to get right. The forcing issue was some obscure programs
involving recursive dictionaries, but these eventually led to a
massive refactoring sweep.
}}}
I compiled `accelerate 0.9.0.0`, with these results
{{{
ghc 1.12.3:
real 0m51.776s
user 0m48.310s
sys 0m1.750s
HEAD:
real 0m49.007s
user 0m46.420s
sys 0m1.380s
}}}
So HEAD is just slightly faster. This conceals a difference, though:
* 6.12 is faster on `Data.Array.Accelerate.Array.Sugar` (5s vs 12s)
* 6.12 is slower on `Data.Array.Accelerate.Smart`
Dimitrios is going to investigate why we are slower on `Sugar`, and that's
why I'll leave the ticket open, but meanwhile I think it's fast enough to
use.
Simon
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/4856#comment:7>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
