[GHC] #2159: Use a more efficient representation than [DynFlag]

[GHC]

#2159: Use a more efficient representation than [DynFlag]
-------------------------------------+-------------------------------------
        Reporter:  igloo             |                Owner:
            Type:  bug               |               Status:  closed
        Priority:  lowest            |            Milestone:
       Component:  Compiler          |              Version:  6.8.2
      Resolution:  fixed             |             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 rwbarton):

 Heh, I was just looking at this too.

 I imagine a bit array representation as in "bitmap.dpatch" would be a lot
 faster though. Especially if you added RULES to inline the case of
 checking for a known flag.

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