[GHC] #9159: cmm case, binary search instead of jump table

[GHC]

#9159: cmm case, binary search instead of jump table
--------------------------------------------+------------------------------
        Reporter:  wojteknar                |            Owner:
            Type:  feature request          |           Status:  new
        Priority:  lowest                   |        Milestone:
       Component:  Compiler                 |          Version:  7.8.2
      Resolution:                           |         Keywords:
Operating System:  Unknown/Multiple         |     Architecture:
 Type of failure:  Runtime performance bug  |  Unknown/Multiple
       Test Case:                           |       Difficulty:  Unknown
        Blocking:                           |       Blocked By:
                                            |  Related Tickets:
--------------------------------------------+------------------------------
Changes (by wojteknar):

 * priority:  low => lowest


Comment:

 Okay, this really is a corner case of case statement.

 For one range the heuristics could be "fill factor". For multiple ranges
 it gets really difficult.

 The workaround with Enum and tagToEnum# works fine. Perhaps I should just
 close this ticket?

--
Ticket URL: <http://ghc.haskell.org/trac/ghc/ticket/9159#comment:4>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler