[GHC] #15770: Missing optimisation opportunity in code gen for always-saturated applications?

[GHC]

#15770: Missing optimisation opportunity in code gen for always-saturated
applications?
-------------------------------------+-------------------------------------
        Reporter:  osa1              |                Owner:  (none)
            Type:  bug               |               Status:  new
        Priority:  normal            |            Milestone:
       Component:  Compiler          |              Version:
      Resolution:                    |             Keywords:
Operating System:  Unknown/Multiple  |         Architecture:
                                     |  Unknown/Multiple
 Type of failure:  None/Unknown      |            Test Case:
      Blocked By:                    |             Blocking:
 Related Tickets:                    |  Differential Rev(s):
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by simonmar):

 Even if there were saturated calls only, we'd still need the info table
 and slow entry code to support the heap/stack checks. And we'd need the
 info table for the closure, which might be referred to by SRTs. And the
 function has to be not externally visible. So it seems like only in very
 narrow circumstances could we save anything here.

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