[GHC] #2374: MutableByteArray# is slower than Addr#

[GHC]

#2374: MutableByteArray# is slower than Addr#
-------------------------------------+-------------------------------------
        Reporter:  dolio             |                Owner:
            Type:  bug               |               Status:  new
        Priority:  lowest            |            Milestone:  8.0.1
       Component:  Compiler (NCG)    |              Version:  6.8.2
      Resolution:                    |             Keywords:  performance
                                     |  array
Operating System:  Linux             |         Architecture:  x86_64
 Type of failure:  Runtime           |  (amd64)
  performance bug                    |            Test Case:
      Blocked By:                    |             Blocking:
 Related Tickets:                    |  Differential Rev(s):
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by bgamari):

 Hmm, indeed there still seems to be a bit of a difference here
 ([[https://github.com/bgamari/T2374-benchmark|benchmark]]).
 {{{
 benchmarking ptr
 time                 949.1 ms   (945.9 ms .. 953.2 ms)
                      1.000 R²   (1.000 R² .. 1.000 R²)
 mean                 954.2 ms   (952.3 ms .. 955.7 ms)
 std dev              2.470 ms   (0.0 s .. 2.710 ms)
 variance introduced by outliers: 19% (moderately inflated)

 benchmarking bytearr
 time                 989.2 ms   (979.9 ms .. 997.8 ms)
                      1.000 R²   (1.000 R² .. 1.000 R²)
 mean                 984.2 ms   (981.2 ms .. 986.3 ms)
 std dev              3.125 ms   (0.0 s .. 3.602 ms)
 variance introduced by outliers: 19% (moderately inflated)
 }}}

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