[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):  Phab:D5232
       Wiki Page:                    |
-------------------------------------+-------------------------------------

Comment (by sgraf):

 I'm conveniently using `satCallsOnly` when performing
 [https://github.com/sgraf812/ghc/blob/7839fe7fdb1a0b89d1edbff56f7ab6cee6293b0b/compiler/simplStg/StgLiftLams/Analysis.hs#L296
 late lambda lifting]. It would not be terribly upsetting to see this go,
 but I found it convenient not having to compute the same analysis info
 myself.

 The same arguments as for free variables apply, though: It's occurrence
 information which is probably fragile enough to just be generated on
 demand.

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