DsBinds.hs 50.2 KB
Newer Older
Austin Seipp's avatar
Austin Seipp committed
1 2 3 4
{-
(c) The University of Glasgow 2006
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998

Simon Marlow's avatar
Simon Marlow committed
5 6

Pattern-matching bindings (HsBinds and MonoBinds)
7

8 9 10
Handles @HsBinds@; those at the top level require different handling,
in that the @Rec@/@NonRec@/etc structure is thrown away (whereas at
lower levels it is preserved with @let@/@letrec@s).
Austin Seipp's avatar
Austin Seipp committed
11
-}
12

13
{-# LANGUAGE CPP #-}
Ian Lynagh's avatar
Ian Lynagh committed
14

15
module DsBinds ( dsTopLHsBinds, dsLHsBinds, decomposeRuleLhs, dsSpec,
16
                 dsHsWrapper, dsTcEvBinds, dsTcEvBinds_s, dsEvBinds, dsMkUserRule
17
  ) where
18

19 20
#include "HsVersions.h"

21 22
import {-# SOURCE #-}   DsExpr( dsLExpr )
import {-# SOURCE #-}   Match( matchWrapper )
23

24
import DsMonad
Simon Marlow's avatar
Simon Marlow committed
25
import DsGRHSs
26
import DsUtils
27

28 29
import HsSyn            -- lots of things
import CoreSyn          -- lots of things
30
import Literal          ( Literal(MachStr) )
31
import CoreSubst
32
import OccurAnal        ( occurAnalyseExpr )
33
import MkCore
Simon Marlow's avatar
Simon Marlow committed
34
import CoreUtils
35
import CoreArity ( etaExpand )
36
import CoreUnfold
37
import CoreFVs
38
import Digraph
39

40
import PrelNames
41
import TysPrim ( mkProxyPrimTy )
42
import TyCon
43
import TcEvidence
44
import TcType
45
import Type
46
import Coercion
Eric Seidel's avatar
Eric Seidel committed
47
import TysWiredIn ( typeNatKind, typeSymbolKind )
Simon Marlow's avatar
Simon Marlow committed
48
import Id
49
import MkId(proxyHashId)
50
import Class
51
import Name
52
import VarSet
Simon Marlow's avatar
Simon Marlow committed
53
import Rules
54
import VarEnv
55
import Outputable
56
import Module
Simon Marlow's avatar
Simon Marlow committed
57 58
import SrcLoc
import Maybes
59
import OrdList
Simon Marlow's avatar
Simon Marlow committed
60 61
import Bag
import BasicTypes hiding ( TopLevel )
Ian Lynagh's avatar
Ian Lynagh committed
62
import DynFlags
Simon Marlow's avatar
Simon Marlow committed
63
import FastString
64
import Util
65
import MonadUtils
66
import qualified GHC.LanguageExtensions as LangExt
67
import Control.Monad
68

69
{-**********************************************************************
Austin Seipp's avatar
Austin Seipp committed
70
*                                                                      *
71
           Desugaring a MonoBinds
Austin Seipp's avatar
Austin Seipp committed
72
*                                                                      *
73
**********************************************************************-}
74

75 76
-- | Desugar top level binds, strict binds are treated like normal
-- binds since there is no good time to force before first usage.
77
dsTopLHsBinds :: LHsBinds Id -> DsM (OrdList (Id,CoreExpr))
78
dsTopLHsBinds binds = fmap (toOL . snd) (ds_lhs_binds binds)
79

80 81 82 83 84 85
-- | Desugar all other kind of bindings, Ids of strict binds are returned to
-- later be forced in the binding gorup body, see Note [Desugar Strict binds]
dsLHsBinds :: LHsBinds Id
           -> DsM ([Id], [(Id,CoreExpr)])
dsLHsBinds binds = do { (force_vars, binds') <- ds_lhs_binds binds
                      ; return (force_vars, binds') }
86 87

------------------------
88

89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113
ds_lhs_binds :: LHsBinds Id -> DsM ([Id], [(Id,CoreExpr)])

ds_lhs_binds binds
  = do { ds_bs <- mapBagM dsLHsBind binds
       ; return (foldBag (\(a, a') (b, b') -> (a ++ b, a' ++ b'))
                         id ([], []) ds_bs) }

dsLHsBind :: LHsBind Id
          -> DsM ([Id], [(Id,CoreExpr)])
dsLHsBind (L loc bind) = do dflags <- getDynFlags
                            putSrcSpanDs loc $ dsHsBind dflags bind

-- | Desugar a single binding (or group of recursive binds).
dsHsBind :: DynFlags
         -> HsBind Id
         -> DsM ([Id], [(Id,CoreExpr)])
         -- ^ The Ids of strict binds, to be forced in the body of the
         -- binding group see Note [Desugar Strict binds] and all
         -- bindings and their desugared right hand sides.

dsHsBind dflags
         (VarBind { var_id = var
                  , var_rhs = expr
                  , var_inline = inline_regardless })
  = do  { core_expr <- dsLExpr expr
114 115
                -- Dictionary bindings are always VarBinds,
                -- so we only need do this here
116
        ; let var' | inline_regardless = var `setIdUnfolding` mkCompulsoryUnfolding core_expr
117
                   | otherwise         = var
118
        ; let core_bind@(id,_) = makeCorePair dflags var' False 0 core_expr
119
              force_var = if xopt LangExt.Strict dflags
120 121 122 123 124 125
                          then [id]
                          else []
        ; return (force_var, [core_bind]) }

dsHsBind dflags
         (FunBind { fun_id = L _ fun, fun_matches = matches
126
                  , fun_co_fn = co_fn, fun_tick = tick })
127 128 129
 = do   { (args, body) <- matchWrapper
                           (FunRhs (noLoc $ idName fun) Prefix)
                           Nothing matches
130
        ; let body' = mkOptTickBox tick body
131
        ; rhs <- dsHsWrapper co_fn (mkLams args body')
132 133
        ; let core_binds@(id,_) = makeCorePair dflags fun False 0 rhs
              force_var =
134
                if xopt LangExt.Strict dflags
135 136 137
                   && matchGroupArity matches == 0 -- no need to force lambdas
                then [id]
                else []
138
        ; {- pprTrace "dsHsBind" (ppr fun <+> ppr (idInlinePragma fun)) $ -}
139
           return (force_var, [core_binds]) }
140

141 142
dsHsBind dflags
         (PatBind { pat_lhs = pat, pat_rhs = grhss, pat_rhs_ty = ty
143
                  , pat_ticks = (rhs_tick, var_ticks) })
144
  = do  { body_expr <- dsGuarded grhss ty
145
        ; let body' = mkOptTickBox rhs_tick body_expr
146
              pat'  = decideBangHood dflags pat
147
        ; (force_var,sel_binds) <- mkSelectorBinds var_ticks pat body'
148 149
          -- We silently ignore inline pragmas; no makeCorePair
          -- Not so cool, but really doesn't matter
150 151
        ; let force_var' = if isBangedLPat pat'
                           then [force_var]
152 153
                           else []
        ; return (force_var', sel_binds) }
sof's avatar
sof committed
154

155
        -- A common case: one exported variable, only non-strict binds
156
        -- Non-recursive bindings come through this way
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
157 158
        -- So do self-recursive bindings
        -- Bindings with complete signatures are AbsBindsSigs, below
159 160
dsHsBind dflags
         (AbsBinds { abs_tvs = tyvars, abs_ev_vars = dicts
161 162
                   , abs_exports = [export]
                   , abs_ev_binds = ev_binds, abs_binds = binds })
163
  | ABE { abe_wrap = wrap, abe_poly = global
164
        , abe_mono = local, abe_prags = prags } <- export
165 166 167
  , not (xopt LangExt.Strict dflags)             -- Handle strict binds
  , not (anyBag (isBangedPatBind . unLoc) binds) --        in the next case
  = -- See Note [AbsBinds wrappers] in HsBinds
168
    addDictsDs (toTcTypeBag (listToBag dicts)) $
169 170 171 172 173 174 175 176 177
         -- addDictsDs: push type constraints deeper for pattern match check
    do { (_, bind_prs) <- ds_lhs_binds binds
       ; let core_bind = Rec bind_prs
       ; ds_binds <- dsTcEvBinds_s ev_binds
       ; rhs <- dsHsWrapper wrap $  -- Usually the identity
                mkLams tyvars $ mkLams dicts $
                mkCoreLets ds_binds $
                Let core_bind $
                Var local
178

179
       ; (spec_binds, rules) <- dsSpecs rhs prags
180

181 182 183
       ; let   global'  = addIdSpecialisations global rules
               main_bind = makeCorePair dflags global' (isDefaultMethod prags)
                                        (dictArity dicts) rhs
184

185
       ; return ([], main_bind : fromOL spec_binds) }
sof's avatar
sof committed
186

187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206
        -- Another common case: no tyvars, no dicts
        -- In this case we can have a much simpler desugaring
dsHsBind dflags
         (AbsBinds { abs_tvs = [], abs_ev_vars = []
                   , abs_exports = exports
                   , abs_ev_binds = ev_binds, abs_binds = binds })
  = do { (force_vars, bind_prs) <- ds_lhs_binds binds
       ; let mk_bind (ABE { abe_wrap = wrap
                          , abe_poly = global
                          , abe_mono = local
                          , abe_prags = prags })
              = do { rhs <- dsHsWrapper wrap (Var local)
                   ; return (makeCorePair dflags global
                                          (isDefaultMethod prags)
                                          0 rhs) }
       ; main_binds <- mapM mk_bind exports

       ; ds_binds <- dsTcEvBinds_s ev_binds
       ; return (force_vars, flattenBinds ds_binds ++ bind_prs ++ main_binds) }

207 208
dsHsBind dflags
         (AbsBinds { abs_tvs = tyvars, abs_ev_vars = dicts
209 210
                   , abs_exports = exports, abs_ev_binds = ev_binds
                   , abs_binds = binds })
211
         -- See Note [Desugaring AbsBinds]
212 213
  = addDictsDs (toTcTypeBag (listToBag dicts)) $
         -- addDictsDs: push type constraints deeper for pattern match check
214
     do { (local_force_vars, bind_prs) <- ds_lhs_binds binds
215
        ; let core_bind = Rec [ makeCorePair dflags (add_inline lcl_id) False 0 rhs
216
                              | (lcl_id, rhs) <- bind_prs ]
217
                -- Monomorphic recursion possible, hence Rec
218
              new_force_vars = get_new_force_vars local_force_vars
219
              locals       = map abe_mono exports
220 221
              all_locals   = locals ++ new_force_vars
              tup_expr     = mkBigCoreVarTup all_locals
222
              tup_ty       = exprType tup_expr
223
        ; ds_binds <- dsTcEvBinds_s ev_binds
224 225 226 227
        ; let poly_tup_rhs = mkLams tyvars $ mkLams dicts $
                             mkCoreLets ds_binds $
                             Let core_bind $
                             tup_expr
228

229
        ; poly_tup_id <- newSysLocalDs (exprType poly_tup_rhs)
230

231 232 233 234 235
        -- Find corresponding global or make up a new one: sometimes
        -- we need to make new export to desugar strict binds, see
        -- Note [Desugar Strict binds]
        ; (exported_force_vars, extra_exports) <- get_exports local_force_vars

236
        ; let mk_bind (ABE { abe_wrap = wrap
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
237
                           , abe_poly = global
238
                           , abe_mono = local, abe_prags = spec_prags })
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
239
                         -- See Note [AbsBinds wrappers] in HsBinds
240 241
                = do { tup_id  <- newSysLocalDs tup_ty
                     ; rhs <- dsHsWrapper wrap $
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
242
                              mkLams tyvars $ mkLams dicts $
243 244
                              mkTupleSelector all_locals local tup_id $
                              mkVarApps (Var poly_tup_id) (tyvars ++ dicts)
245
                     ; let rhs_for_spec = Let (NonRec poly_tup_id poly_tup_rhs) rhs
246 247
                     ; (spec_binds, rules) <- dsSpecs rhs_for_spec spec_prags
                     ; let global' = (global `setInlinePragma` defaultInlinePragma)
248 249 250
                                             `addIdSpecialisations` rules
                           -- Kill the INLINE pragma because it applies to
                           -- the user written (local) function.  The global
251
                           -- Id is just the selector.  Hmm.
252
                     ; return ((global', rhs) : fromOL spec_binds) }
253

254
        ; export_binds_s <- mapM mk_bind (exports ++ extra_exports)
255

256 257 258
        ; return (exported_force_vars
                 ,(poly_tup_id, poly_tup_rhs) :
                   concat export_binds_s) }
259 260 261 262 263
  where
    inline_env :: IdEnv Id   -- Maps a monomorphic local Id to one with
                             -- the inline pragma from the source
                             -- The type checker put the inline pragma
                             -- on the *global* Id, so we need to transfer it
264 265 266 267
    inline_env
      = mkVarEnv [ (lcl_id, setInlinePragma lcl_id prag)
                 | ABE { abe_mono = lcl_id, abe_poly = gbl_id } <- exports
                 , let prag = idInlinePragma gbl_id ]
268 269

    add_inline :: Id -> Id    -- tran
270 271
    add_inline lcl_id = lookupVarEnv inline_env lcl_id
                        `orElse` lcl_id
272

273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304
    global_env :: IdEnv Id -- Maps local Id to its global exported Id
    global_env =
      mkVarEnv [ (local, global)
               | ABE { abe_mono = local, abe_poly = global } <- exports
               ]

    -- find variables that are not exported
    get_new_force_vars lcls =
      foldr (\lcl acc -> case lookupVarEnv global_env lcl of
                           Just _ -> acc
                           Nothing -> lcl:acc)
            [] lcls

    -- find exports or make up new exports for force variables
    get_exports :: [Id] -> DsM ([Id], [ABExport Id])
    get_exports lcls =
      foldM (\(glbls, exports) lcl ->
              case lookupVarEnv global_env lcl of
                Just glbl -> return (glbl:glbls, exports)
                Nothing   -> do export <- mk_export lcl
                                let glbl = abe_poly export
                                return (glbl:glbls, export:exports))
            ([],[]) lcls

    mk_export local =
      do global <- newSysLocalDs
                     (exprType (mkLams tyvars (mkLams dicts (Var local))))
         return (ABE {abe_poly = global
                     ,abe_mono = local
                     ,abe_wrap = WpHole
                     ,abe_prags = SpecPrags []})

305
-- AbsBindsSig is a combination of AbsBinds and FunBind
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
306 307 308 309 310 311 312 313 314 315
dsHsBind dflags (AbsBindsSig { abs_tvs = tyvars, abs_ev_vars = dicts
                             , abs_sig_export  = global
                             , abs_sig_prags   = prags
                             , abs_sig_ev_bind = ev_bind
                             , abs_sig_bind    = bind })
  | L bind_loc FunBind { fun_matches = matches
                       , fun_co_fn   = co_fn
                       , fun_tick    = tick } <- bind
  = putSrcSpanDs bind_loc $
    addDictsDs (toTcTypeBag (listToBag dicts)) $
316
             -- addDictsDs: push type constraints deeper for pattern match check
317 318 319
    do { (args, body) <- matchWrapper
                           (FunRhs (noLoc $ idName global) Prefix)
                           Nothing matches
eir@cis.upenn.edu's avatar
eir@cis.upenn.edu committed
320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345
       ; let body' = mkOptTickBox tick body
       ; fun_rhs <- dsHsWrapper co_fn $
                    mkLams args body'
       ; let force_vars
               | xopt LangExt.Strict dflags
               , matchGroupArity matches == 0 -- no need to force lambdas
               = [global]
               | otherwise
               = []

       ; ds_binds <- dsTcEvBinds ev_bind
       ; let rhs = mkLams tyvars $
                   mkLams dicts $
                   mkCoreLets ds_binds $
                   fun_rhs

       ; (spec_binds, rules) <- dsSpecs rhs prags
       ; let global' = addIdSpecialisations global rules
             main_bind = makeCorePair dflags global' (isDefaultMethod prags)
                                      (dictArity dicts) rhs

       ; return (force_vars, main_bind : fromOL spec_binds) }

  | otherwise
  = pprPanic "dsHsBind: AbsBindsSig" (ppr bind)

346 347
dsHsBind _ (PatSynBind{}) = panic "dsHsBind: PatSynBind"

cactus's avatar
cactus committed
348

349 350

-- | This is where we apply INLINE and INLINABLE pragmas. All we need to
351 352 353 354 355 356
-- do is to attach the unfolding information to the Id.
--
-- Other decisions about whether to inline are made in
-- `calcUnfoldingGuidance` but the decision about whether to then expose
-- the unfolding in the interface file is made in `TidyPgm.addExternal`
-- using this information.
357
------------------------
358 359
makeCorePair :: DynFlags -> Id -> Bool -> Arity -> CoreExpr -> (Id, CoreExpr)
makeCorePair dflags gbl_id is_default_method dict_arity rhs
360
  | is_default_method                 -- Default methods are *always* inlined
361 362
  = (gbl_id `setIdUnfolding` mkCompulsoryUnfolding rhs, rhs)

363 364
  | otherwise
  = case inlinePragmaSpec inline_prag of
365 366 367
          EmptyInlineSpec -> (gbl_id, rhs)
          NoInline        -> (gbl_id, rhs)
          Inlinable       -> (gbl_id `setIdUnfolding` inlinable_unf, rhs)
368
          Inline          -> inline_pair
369

370 371
  where
    inline_prag   = idInlinePragma gbl_id
372
    inlinable_unf = mkInlinableUnfolding dflags rhs
373 374
    inline_pair
       | Just arity <- inlinePragmaSat inline_prag
375 376
        -- Add an Unfolding for an INLINE (but not for NOINLINE)
        -- And eta-expand the RHS; see Note [Eta-expanding INLINE things]
377
       , let real_arity = dict_arity + arity
378
        -- NB: The arity in the InlineRule takes account of the dictionaries
379 380 381 382 383 384
       = ( gbl_id `setIdUnfolding` mkInlineUnfolding (Just real_arity) rhs
         , etaExpand real_arity rhs)

       | otherwise
       = pprTrace "makeCorePair: arity missing" (ppr gbl_id) $
         (gbl_id `setIdUnfolding` mkInlineUnfolding Nothing rhs, rhs)
385 386 387 388

dictArity :: [Var] -> Arity
-- Don't count coercion variables in arity
dictArity dicts = count isId dicts
389

Austin Seipp's avatar
Austin Seipp committed
390
{-
391 392
Note [Desugaring AbsBinds]
~~~~~~~~~~~~~~~~~~~~~~~~~~
393 394 395 396 397 398 399 400
In the general AbsBinds case we desugar the binding to this:

       tup a (d:Num a) = let fm = ...gm...
                             gm = ...fm...
                         in (fm,gm)
       f a d = case tup a d of { (fm,gm) -> fm }
       g a d = case tup a d of { (fm,gm) -> fm }

401 402 403 404 405
Note [Rules and inlining]
~~~~~~~~~~~~~~~~~~~~~~~~~
Common special case: no type or dictionary abstraction
This is a bit less trivial than you might suppose
The naive way woudl be to desguar to something like
406 407
        f_lcl = ...f_lcl...     -- The "binds" from AbsBinds
        M.f = f_lcl             -- Generated from "exports"
408
But we don't want that, because if M.f isn't exported,
409 410
it'll be inlined unconditionally at every call site (its rhs is
trivial).  That would be ok unless it has RULES, which would
411 412 413
thereby be completely lost.  Bad, bad, bad.

Instead we want to generate
414 415 416
        M.f = ...f_lcl...
        f_lcl = M.f
Now all is cool. The RULES are attached to M.f (by SimplCore),
417 418 419 420
and f_lcl is rapidly inlined away.

This does not happen in the same way to polymorphic binds,
because they desugar to
421
        M.f = /\a. let f_lcl = ...f_lcl... in f_lcl
422
Although I'm a bit worried about whether full laziness might
423
float the f_lcl binding out and then inline M.f at its call site
424 425 426 427 428 429 430 431 432 433 434 435 436 437 438

Note [Specialising in no-dict case]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Even if there are no tyvars or dicts, we may have specialisation pragmas.
Class methods can generate
      AbsBinds [] [] [( ... spec-prag]
         { AbsBinds [tvs] [dicts] ...blah }
So the overloading is in the nested AbsBinds. A good example is in GHC.Float:

  class  (Real a, Fractional a) => RealFrac a  where
    round :: (Integral b) => a -> b

  instance  RealFrac Float  where
    {-# SPECIALIZE round :: Float -> Int #-}

439
The top-level AbsBinds for $cround has no tyvars or dicts (because the
440 441 442 443 444 445 446
instance does not).  But the method is locally overloaded!

Note [Abstracting over tyvars only]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
When abstracting over type variable only (not dictionaries), we don't really need to
built a tuple and select from it, as we do in the general case. Instead we can take

447 448 449 450 451
        AbsBinds [a,b] [ ([a,b], fg, fl, _),
                         ([b],   gg, gl, _) ]
                { fl = e1
                  gl = e2
                   h = e3 }
452 453 454

and desugar it to

455 456 457
        fg = /\ab. let B in e1
        gg = /\b. let a = () in let B in S(e2)
        h  = /\ab. let B in e3
458 459

where B is the *non-recursive* binding
460 461 462
        fl = fg a b
        gl = gg b
        h  = h a b    -- See (b); note shadowing!
463 464

Notice (a) g has a different number of type variables to f, so we must
465 466
             use the mkArbitraryType thing to fill in the gaps.
             We use a type-let to do that.
467

468 469 470 471
         (b) The local variable h isn't in the exports, and rather than
             clone a fresh copy we simply replace h by (h a b), where
             the two h's have different types!  Shadowing happens here,
             which looks confusing but works fine.
472

473 474 475 476
         (c) The result is *still* quadratic-sized if there are a lot of
             small bindings.  So if there are more than some small
             number (10), we filter the binding set B by the free
             variables of the particular RHS.  Tiresome.
477 478

Why got to this trouble?  It's a common case, and it removes the
479
quadratic-sized tuple desugaring.  Less clutter, hopefully faster
480 481 482 483
compilation, especially in a case where there are a *lot* of
bindings.


484 485 486 487 488 489 490 491
Note [Eta-expanding INLINE things]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Consider
   foo :: Eq a => a -> a
   {-# INLINE foo #-}
   foo x = ...

If (foo d) ever gets floated out as a common sub-expression (which can
492
happen as a result of method sharing), there's a danger that we never
493 494 495 496
get to do the inlining, which is a Terribly Bad thing given that the
user said "inline"!

To avoid this we pre-emptively eta-expand the definition, so that foo
simonpj@microsoft.com's avatar
simonpj@microsoft.com committed
497
has the arity with which it is declared in the source code.  In this
498
example it has arity 2 (one for the Eq and one for x). Doing this
simonpj@microsoft.com's avatar
simonpj@microsoft.com committed
499
should mean that (foo d) is a PAP and we don't share it.
500 501 502

Note [Nested arities]
~~~~~~~~~~~~~~~~~~~~~
503 504 505 506 507 508 509 510 511 512 513 514 515 516
For reasons that are not entirely clear, method bindings come out looking like
this:

  AbsBinds [] [] [$cfromT <= [] fromT]
    $cfromT [InlPrag=INLINE] :: T Bool -> Bool
    { AbsBinds [] [] [fromT <= [] fromT_1]
        fromT :: T Bool -> Bool
        { fromT_1 ((TBool b)) = not b } } }

Note the nested AbsBind.  The arity for the InlineRule on $cfromT should be
gotten from the binding for fromT_1.

It might be better to have just one level of AbsBinds, but that requires more
thought!
517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572


Note [Desugar Strict binds]
~~~~~~~~~~~~~~~~~~~~~~~~~~~

Desugaring strict variable bindings looks as follows (core below ==>)

  let !x = rhs
  in  body
==>
  let x = rhs
  in x `seq` body -- seq the variable

and if it is a pattern binding the desugaring looks like

  let !pat = rhs
  in body
==>
  let x = rhs -- bind the rhs to a new variable
      pat = x
  in x `seq` body -- seq the new variable

if there is no variable in the pattern desugaring looks like

  let False = rhs
  in body
==>
  let x = case rhs of {False -> (); _ -> error "Match failed"}
  in x `seq` body

In order to force the Ids in the binding group they are passed around
in the dsHsBind family of functions, and later seq'ed in DsExpr.ds_val_bind.

Consider a recursive group like this

  letrec
     f : g = rhs[f,g]
  in <body>

Without `Strict`, we get a translation like this:

  let t = /\a. letrec tm = rhs[fm,gm]
                      fm = case t of fm:_ -> fm
                      gm = case t of _:gm -> gm
                in
                (fm,gm)

  in let f = /\a. case t a of (fm,_) -> fm
  in let g = /\a. case t a of (_,gm) -> gm
  in <body>

Here `tm` is the monomorphic binding for `rhs`.

With `Strict`, we want to force `tm`, but NOT `fm` or `gm`.
Alas, `tm` isn't in scope in the `in <body>` part.

Gabor Greif's avatar
Gabor Greif committed
573
The simplest thing is to return it in the polymorphic
574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590
tuple `t`, thus:

  let t = /\a. letrec tm = rhs[fm,gm]
                      fm = case t of fm:_ -> fm
                      gm = case t of _:gm -> gm
                in
                (tm, fm, gm)

  in let f = /\a. case t a of (_,fm,_) -> fm
  in let g = /\a. case t a of (_,_,gm) -> gm
  in let tm = /\a. case t a of (tm,_,_) -> tm
  in tm `seq` <body>


See https://ghc.haskell.org/trac/ghc/wiki/StrictPragma for a more
detailed explanation of the desugaring of strict bindings.

Austin Seipp's avatar
Austin Seipp committed
591
-}
592

593
------------------------
594
dsSpecs :: CoreExpr     -- Its rhs
595
        -> TcSpecPrags
596 597
        -> DsM ( OrdList (Id,CoreExpr)  -- Binding for specialised Ids
               , [CoreRule] )           -- Rules for the Global Ids
598
-- See Note [Handling SPECIALISE pragmas] in TcBinds
599 600 601 602 603 604
dsSpecs _ IsDefaultMethod = return (nilOL, [])
dsSpecs poly_rhs (SpecPrags sps)
  = do { pairs <- mapMaybeM (dsSpec (Just poly_rhs)) sps
       ; let (spec_binds_s, rules) = unzip pairs
       ; return (concatOL spec_binds_s, rules) }

605 606 607
dsSpec :: Maybe CoreExpr        -- Just rhs => RULE is for a local binding
                                -- Nothing => RULE is for an imported Id
                                --            rhs is in the Id's unfolding
608 609 610
       -> Located TcSpecPrag
       -> DsM (Maybe (OrdList (Id,CoreExpr), CoreRule))
dsSpec mb_poly_rhs (L loc (SpecPrag poly_id spec_co spec_inl))
611
  | isJust (isClassOpId_maybe poly_id)
612
  = putSrcSpanDs loc $
613 614
    do { warnDs NoReason (text "Ignoring useless SPECIALISE pragma for class method selector"
                          <+> quotes (ppr poly_id))
615
       ; return Nothing  }  -- There is no point in trying to specialise a class op
616 617
                            -- Moreover, classops don't (currently) have an inl_sat arity set
                            -- (it would be Just 0) and that in turn makes makeCorePair bleat
618

619 620
  | no_act_spec && isNeverActive rule_act
  = putSrcSpanDs loc $
621 622
    do { warnDs NoReason (text "Ignoring useless SPECIALISE pragma for NOINLINE function:"
                          <+> quotes (ppr poly_id))
623
       ; return Nothing  }  -- Function is NOINLINE, and the specialiation inherits that
624
                            -- See Note [Activation pragmas for SPECIALISE]
625

626
  | otherwise
627
  = putSrcSpanDs loc $
628 629
    do { uniq <- newUnique
       ; let poly_name = idName poly_id
630 631
             spec_occ  = mkSpecOcc (getOccName poly_name)
             spec_name = mkInternalName uniq spec_occ (getSrcSpan poly_name)
632 633
       ; (bndrs, ds_lhs) <- liftM collectBinders
                                  (dsHsWrapper spec_co (Var poly_id))
Simon Peyton Jones's avatar
Simon Peyton Jones committed
634
       ; let spec_ty = mkLamTypes bndrs (exprType ds_lhs)
635 636 637
       ; -- pprTrace "dsRule" (vcat [ text "Id:" <+> ppr poly_id
         --                         , text "spec_co:" <+> ppr spec_co
         --                         , text "ds_rhs:" <+> ppr ds_lhs ]) $
638
         case decomposeRuleLhs bndrs ds_lhs of {
639
           Left msg -> do { warnDs NoReason msg; return Nothing } ;
640
           Right (rule_bndrs, _fn, args) -> do
641

642
       { dflags <- getDynFlags
643
       ; this_mod <- getModule
Simon Peyton Jones's avatar
Simon Peyton Jones committed
644 645 646 647
       ; let fn_unf    = realIdUnfolding poly_id
             unf_fvs   = stableUnfoldingVars fn_unf `orElse` emptyVarSet
             in_scope  = mkInScopeSet (unf_fvs `unionVarSet` exprsFreeVars args)
             spec_unf  = specUnfolding dflags (mkEmptySubst in_scope) bndrs args fn_unf
648 649 650
             spec_id   = mkLocalId spec_name spec_ty
                            `setInlinePragma` inl_prag
                            `setIdUnfolding`  spec_unf
651
       ; rule <- dsMkUserRule this_mod is_local_id
Ian Lynagh's avatar
Ian Lynagh committed
652
                        (mkFastString ("SPEC " ++ showPpr dflags poly_name))
653 654 655
                        rule_act poly_name
                        rule_bndrs args
                        (mkVarApps (Var spec_id) bndrs)
656

657
       ; spec_rhs <- dsHsWrapper spec_co poly_rhs
658

659 660
-- Commented out: see Note [SPECIALISE on INLINE functions]
--       ; when (isInlinePragma id_inl)
661
--              (warnDs $ text "SPECIALISE pragma on INLINE function probably won't fire:"
662
--                        <+> quotes (ppr poly_name))
Simon Peyton Jones's avatar
Simon Peyton Jones committed
663 664 665 666 667

       ; return (Just (unitOL (spec_id, spec_rhs), rule))
            -- NB: do *not* use makeCorePair on (spec_id,spec_rhs), because
            --     makeCorePair overwrites the unfolding, which we have
            --     just created using specUnfolding
668 669 670 671
       } } }
  where
    is_local_id = isJust mb_poly_rhs
    poly_rhs | Just rhs <-  mb_poly_rhs
672
             = rhs          -- Local Id; this is its rhs
673 674
             | Just unfolding <- maybeUnfoldingTemplate (realIdUnfolding poly_id)
             = unfolding    -- Imported Id; this is its unfolding
675 676 677
                            -- Use realIdUnfolding so we get the unfolding
                            -- even when it is a loop breaker.
                            -- We want to specialise recursive functions!
678
             | otherwise = pprPanic "dsImpSpecs" (ppr poly_id)
679
                            -- The type checker has checked that it *has* an unfolding
680

681 682 683 684 685
    id_inl = idInlinePragma poly_id

    -- See Note [Activation pragmas for SPECIALISE]
    inl_prag | not (isDefaultInlinePragma spec_inl)    = spec_inl
             | not is_local_id  -- See Note [Specialising imported functions]
686
                                 -- in OccurAnal
687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703
             , isStrongLoopBreaker (idOccInfo poly_id) = neverInlinePragma
             | otherwise                               = id_inl
     -- Get the INLINE pragma from SPECIALISE declaration, or,
     -- failing that, from the original Id

    spec_prag_act = inlinePragmaActivation spec_inl

    -- See Note [Activation pragmas for SPECIALISE]
    -- no_act_spec is True if the user didn't write an explicit
    -- phase specification in the SPECIALISE pragma
    no_act_spec = case inlinePragmaSpec spec_inl of
                    NoInline -> isNeverActive  spec_prag_act
                    _        -> isAlwaysActive spec_prag_act
    rule_act | no_act_spec = inlinePragmaActivation id_inl   -- Inherit
             | otherwise   = spec_prag_act                   -- Specified by user


704 705 706 707 708 709
dsMkUserRule :: Module -> Bool -> RuleName -> Activation
       -> Name -> [CoreBndr] -> [CoreExpr] -> CoreExpr -> DsM CoreRule
dsMkUserRule this_mod is_local name act fn bndrs args rhs = do
    let rule = mkRule this_mod False is_local name act fn bndrs args rhs
    dflags <- getDynFlags
    when (isOrphan (ru_orphan rule) && wopt Opt_WarnOrphans dflags) $
710
        warnDs (Reason Opt_WarnOrphans) (ruleOrphWarn rule)
711 712 713
    return rule

ruleOrphWarn :: CoreRule -> SDoc
714
ruleOrphWarn rule = text "Orphan rule:" <+> ppr rule
715

716 717 718 719 720 721 722 723 724 725 726 727 728
{- Note [SPECIALISE on INLINE functions]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
We used to warn that using SPECIALISE for a function marked INLINE
would be a no-op; but it isn't!  Especially with worker/wrapper split
we might have
   {-# INLINE f #-}
   f :: Ord a => Int -> a -> ...
   f d x y = case x of I# x' -> $wf d x' y

We might want to specialise 'f' so that we in turn specialise '$wf'.
We can't even /name/ '$wf' in the source code, so we can't specialise
it even if we wanted to.  Trac #10721 is a case in point.

729 730 731 732 733 734 735 736
Note [Activation pragmas for SPECIALISE]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
From a user SPECIALISE pragma for f, we generate
  a) A top-level binding    spec_fn = rhs
  b) A RULE                 f dOrd = spec_fn

We need two pragma-like things:

737
* spec_fn's inline pragma: inherited from f's inline pragma (ignoring
738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758
                           activation on SPEC), unless overriden by SPEC INLINE

* Activation of RULE: from SPECIALISE pragma (if activation given)
                      otherwise from f's inline pragma

This is not obvious (see Trac #5237)!

Examples      Rule activation   Inline prag on spec'd fn
---------------------------------------------------------------------
SPEC [n] f :: ty            [n]   Always, or NOINLINE [n]
                                  copy f's prag

NOINLINE f
SPEC [n] f :: ty            [n]   NOINLINE
                                  copy f's prag

NOINLINE [k] f
SPEC [n] f :: ty            [n]   NOINLINE [k]
                                  copy f's prag

INLINE [k] f
759
SPEC [n] f :: ty            [n]   INLINE [k]
760 761 762 763 764 765 766 767 768 769
                                  copy f's prag

SPEC INLINE [n] f :: ty     [n]   INLINE [n]
                                  (ignore INLINE prag on f,
                                  same activation for rule and spec'd fn)

NOINLINE [k] f
SPEC f :: ty                [n]   INLINE [k]


Austin Seipp's avatar
Austin Seipp committed
770 771
************************************************************************
*                                                                      *
772
\subsection{Adding inline pragmas}
Austin Seipp's avatar
Austin Seipp committed
773 774 775
*                                                                      *
************************************************************************
-}
776

777
decomposeRuleLhs :: [Var] -> CoreExpr -> Either SDoc ([Var], Id, [CoreExpr])
unknown's avatar
unknown committed
778 779
-- (decomposeRuleLhs bndrs lhs) takes apart the LHS of a RULE,
-- The 'bndrs' are the quantified binders of the rules, but decomposeRuleLhs
780
-- may add some extra dictionary binders (see Note [Free dictionaries])
unknown's avatar
unknown committed
781
--
782
-- Returns Nothing if the LHS isn't of the expected shape
783 784 785 786 787 788
-- Note [Decomposing the left-hand side of a RULE]
decomposeRuleLhs orig_bndrs orig_lhs
  | not (null unbound)    -- Check for things unbound on LHS
                          -- See Note [Unused spec binders]
  = Left (vcat (map dead_msg unbound))

789
  | Just (fn_id, args) <- decompose fun2 args2
790
  , let extra_bndrs = mk_extra_bndrs fn_id args
791 792 793 794 795 796
  = -- pprTrace "decmposeRuleLhs" (vcat [ text "orig_bndrs:" <+> ppr orig_bndrs
    --                                  , text "orig_lhs:" <+> ppr orig_lhs
    --                                  , text "lhs1:"     <+> ppr lhs1
    --                                  , text "extra_dict_bndrs:" <+> ppr extra_dict_bndrs
    --                                  , text "fn_id:" <+> ppr fn_id
    --                                  , text "args:"   <+> ppr args]) $
797
    Right (orig_bndrs ++ extra_bndrs, fn_id, args)
798

799
  | otherwise
800
  = Left bad_shape_msg
801
 where
802 803 804 805
   lhs1         = drop_dicts orig_lhs
   lhs2         = simpleOptExpr lhs1  -- See Note [Simplify rule LHS]
   (fun2,args2) = collectArgs lhs2

806 807
   lhs_fvs    = exprFreeVars lhs2
   unbound    = filterOut (`elemVarSet` lhs_fvs) orig_bndrs
808

809
   orig_bndr_set = mkVarSet orig_bndrs
810

811 812 813 814 815 816 817 818 819 820 821 822 823
        -- Add extra tyvar binders: Note [Free tyvars in rule LHS]
        -- and extra dict binders: Note [Free dictionaries in rule LHS]
   mk_extra_bndrs fn_id args
     = toposortTyVars unbound_tvs ++ unbound_dicts
     where
       unbound_tvs   = [ v | v <- unbound_vars, isTyVar v ]
       unbound_dicts = [ mkLocalId (localiseName (idName d)) (idType d)
                       | d <- unbound_vars, isDictId d ]
       unbound_vars  = [ v | v <- exprsFreeVarsList args
                           , not (v `elemVarSet` orig_bndr_set)
                           , not (v == fn_id) ]
         -- fn_id: do not quantify over the function itself, which may
         -- itself be a dictionary (in pathological cases, Trac #10251)
824 825 826 827 828 829

   decompose (Var fn_id) args
      | not (fn_id `elemVarSet` orig_bndr_set)
      = Just (fn_id, args)

   decompose _ _ = Nothing
830

831
   bad_shape_msg = hang (text "RULE left-hand side too complicated to desugar")
832 833
                      2 (vcat [ text "Optimised lhs:" <+> ppr lhs2
                              , text "Orig lhs:" <+> ppr orig_lhs])
834 835
   dead_msg bndr = hang (sep [ text "Forall'd" <+> pp_bndr bndr
                             , text "is not bound in RULE lhs"])
836 837 838
                      2 (vcat [ text "Orig bndrs:" <+> ppr orig_bndrs
                              , text "Orig lhs:" <+> ppr orig_lhs
                              , text "optimised lhs:" <+> ppr lhs2 ])
839
   pp_bndr bndr
840 841 842
    | isTyVar bndr                      = text "type variable" <+> quotes (ppr bndr)
    | Just pred <- evVarPred_maybe bndr = text "constraint" <+> quotes (ppr pred)
    | otherwise                         = text "variable" <+> quotes (ppr bndr)
843 844

   drop_dicts :: CoreExpr -> CoreExpr
845
   drop_dicts e
846 847 848
       = wrap_lets needed bnds body
     where
       needed = orig_bndr_set `minusVarSet` exprFreeVars body
849
       (bnds, body) = split_lets (occurAnalyseExpr e)
850
           -- The occurAnalyseExpr drops dead bindings which is
851 852
           -- crucial to ensure that every binding is used later;
           -- which in turn makes wrap_lets work right
853 854

   split_lets :: CoreExpr -> ([(DictId,CoreExpr)], CoreExpr)
855 856
   split_lets (Let (NonRec d r) body)
     | isDictId d
857
     = ((d,r):bs, body')
858 859 860 861 862 863 864 865 866
     where (bs, body') = split_lets body

    -- handle "unlifted lets" too, needed for "map/coerce"
   split_lets (Case r d _ [(DEFAULT, _, body)])
     | isCoVar d
     = ((d,r):bs, body')
     where (bs, body') = split_lets body

   split_lets e = ([], e)
867 868 869 870

   wrap_lets :: VarSet -> [(DictId,CoreExpr)] -> CoreExpr -> CoreExpr
   wrap_lets _ [] body = body
   wrap_lets needed ((d, r) : bs) body
871
     | rhs_fvs `intersectsVarSet` needed = mkCoreLet (NonRec d r) (wrap_lets needed' bs body)
872 873 874 875
     | otherwise                         = wrap_lets needed bs body
     where
       rhs_fvs = exprFreeVars r
       needed' = (needed `minusVarSet` rhs_fvs) `extendVarSet` d
876

Austin Seipp's avatar
Austin Seipp committed
877
{-
878
Note [Decomposing the left-hand side of a RULE]
879
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
880
There are several things going on here.
881 882
* drop_dicts: see Note [Drop dictionary bindings on rule LHS]
* simpleOptExpr: see Note [Simplify rule LHS]
883
* extra_dict_bndrs: see Note [Free dictionaries]
884

885 886 887 888 889 890 891 892 893 894 895 896 897
Note [Free tyvars on rule LHS]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Consider
  data T a = C

  foo :: T a -> Int
  foo C = 1

  {-# RULES "myrule"  foo C = 1 #-}

After type checking the LHS becomes (foo alpha (C alpha)), where alpha
is an unbound meta-tyvar.  The zonker in TcHsSyn is careful not to
turn the free alpha into Any (as it usually does).  Instead it turns it
898
into a TyVar 'a'.  See TcHsSyn Note [Zonking the LHS of a RULE].
899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932

Now we must quantify over that 'a'.  It's /really/ inconvenient to do that
in the zonker, because the HsExpr data type is very large.  But it's /easy/
to do it here in the desugarer.

Moreover, we have to do something rather similar for dictionaries;
see Note [Free dictionaries on rule LHS].   So that's why we look for
type variables free on the LHS, and quantify over them.

Note [Free dictionaries on rule LHS]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
When the LHS of a specialisation rule, (/\as\ds. f es) has a free dict,
which is presumably in scope at the function definition site, we can quantify
over it too.  *Any* dict with that type will do.

So for example when you have
        f :: Eq a => a -> a
        f = <rhs>
        ... SPECIALISE f :: Int -> Int ...

Then we get the SpecPrag
        SpecPrag (f Int dInt)

And from that we want the rule

        RULE forall dInt. f Int dInt = f_spec
        f_spec = let f = <rhs> in f Int dInt

But be careful!  That dInt might be GHC.Base.$fOrdInt, which is an External
Name, and you can't bind them in a lambda or forall without getting things
confused.   Likewise it might have an InlineRule or something, which would be
utterly bogus. So we really make a fresh Id, with the same unique and type
as the old one, but with an Internal name and no IdInfo.

933 934
Note [Drop dictionary bindings on rule LHS]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
935
drop_dicts drops dictionary bindings on the LHS where possible.
936 937
   E.g.  let d:Eq [Int] = $fEqList $fEqInt in f d
     --> f d
938
   Reasoning here is that there is only one d:Eq [Int], and so we can
939 940 941 942
   quantify over it. That makes 'd' free in the LHS, but that is later
   picked up by extra_dict_bndrs (Note [Dead spec binders]).

   NB 1: We can only drop the binding if the RHS doesn't bind
943
         one of the orig_bndrs, which we assume occur on RHS.
944 945 946 947 948 949
         Example
            f :: (Eq a) => b -> a -> a
            {-# SPECIALISE f :: Eq a => b -> [a] -> [a] #-}
         Here we want to end up with
            RULE forall d:Eq a.  f ($dfEqList d) = f_spec d
         Of course, the ($dfEqlist d) in the pattern makes it less likely
950
         to match, but there is no other way to get d:Eq a
951

952
   NB 2: We do drop_dicts *before* simplOptEpxr, so that we expect all
953 954 955 956 957 958
         the evidence bindings to be wrapped around the outside of the
         LHS.  (After simplOptExpr they'll usually have been inlined.)
         dsHsWrapper does dependency analysis, so that civilised ones
         will be simple NonRec bindings.  We don't handle recursive
         dictionaries!

Gabor Greif's avatar
Gabor Greif committed
959
    NB3: In the common case of a non-overloaded, but perhaps-polymorphic
960 961 962 963 964 965
         specialisation, we don't need to bind *any* dictionaries for use
         in the RHS. For example (Trac #8331)
             {-# SPECIALIZE INLINE useAbstractMonad :: ReaderST s Int #-}
             useAbstractMonad :: MonadAbstractIOST m => m Int
         Here, deriving (MonadAbstractIOST (ReaderST s)) is a lot of code
         but the RHS uses no dictionaries, so we want to end up with
966
             RULE forall s (d :: MonadAbstractIOST (ReaderT s)).
967 968
                useAbstractMonad (ReaderT s) d = $suseAbstractMonad s

969 970 971
   Trac #8848 is a good example of where there are some intersting
   dictionary bindings to discard.

972 973 974 975 976 977 978 979 980 981
The drop_dicts algorithm is based on these observations:

  * Given (let d = rhs in e) where d is a DictId,
    matching 'e' will bind e's free variables.

  * So we want to keep the binding if one of the needed variables (for
    which we need a binding) is in fv(rhs) but not already in fv(e).

  * The "needed variables" are simply the orig_bndrs.  Consider
       f :: (Eq a, Show b) => a -> b -> String
Austin Seipp's avatar
Austin Seipp committed
982
       ... SPECIALISE f :: (Show b) => Int -> b -> String ...
983 984 985 986 987 988
    Then orig_bndrs includes the *quantified* dictionaries of the type
    namely (dsb::Show b), but not the one for Eq Int

So we work inside out, applying the above criterion at each step.


989 990 991 992
Note [Simplify rule LHS]
~~~~~~~~~~~~~~~~~~~~~~~~
simplOptExpr occurrence-analyses and simplifies the LHS:

993
   (a) Inline any remaining dictionary bindings (which hopefully
994 995 996
       occur just once)

   (b) Substitute trivial lets so that they don't get in the way
997
       Note that we substitute the function too; we might
998 999
       have this as a LHS:  let f71 = M.f Int in f71

1000
   (c) Do eta reduction.  To see why, consider the fold/build rule,
1001 1002 1003 1004
       which without simplification looked like:
          fold k z (build (/\a. g a))  ==>  ...
       This doesn't match unless you do eta reduction on the build argument.
       Similarly for a LHS like
1005
         augment g (build h)
1006
       we do not want to get
1007
         augment (\a. g a) (build h)
1008 1009
       otherwise we don't match when given an argument like
          augment (\a. h a a) (build h)
1010

1011
Note [Matching seqId]
1012 1013
~~~~~~~~~~~~~~~~~~~
The desugarer turns (seq e r) into (case e of _ -> r), via a special-case hack
1014
and this code turns it back into an application of seq!
simonpj@microsoft.com's avatar