TcSMonad.lhs 62.6 KB
Newer Older
1
\begin{code}
2
{-# OPTIONS -fno-warn-tabs #-}
Ian Lynagh's avatar
Ian Lynagh committed
3
4
5
6
7
8
-- The above warning supression flag is a temporary kludge.
-- While working on this module you are encouraged to remove it and
-- detab the module (please do the detabbing in a separate patch). See
--     http://hackage.haskell.org/trac/ghc/wiki/Commentary/CodingStyle#TabsvsSpaces
-- for details

9
10
11
-- Type definitions for the constraint solver
module TcSMonad ( 

12
       -- Canonical constraints, definition is now in TcRnTypes
13

14
15
16
    WorkList(..), isEmptyWorkList, emptyWorkList,
    workListFromEq, workListFromNonEq, workListFromCt, 
    extendWorkListEq, extendWorkListNonEq, extendWorkListCt, 
dimitris's avatar
dimitris committed
17
    appendWorkListCt, appendWorkListEqs, unionWorkList, selectWorkItem,
18

19
    getTcSWorkList, updWorkListTcS, updWorkListTcS_return, keepWanted,
20
    getTcSWorkListTvs, 
21
22
    
    getTcSImplics, updTcSImplics, emitTcSImplication, 
23
24
25

    Ct(..), Xi, tyVarsOfCt, tyVarsOfCts, tyVarsOfCDicts, 
    emitFrozenError,
26

dimitris's avatar
dimitris committed
27
    isWanted, isGivenOrSolved, isDerived,
dimitris's avatar
dimitris committed
28
    isGivenOrSolvedCt, isGivenCt, 
dimitris's avatar
dimitris committed
29
    isWantedCt, isDerivedCt, pprFlavorArising,
30

31
32
    isFlexiTcsTv,

33
    canRewrite, canSolve,
dimitris's avatar
dimitris committed
34
    mkSolvedLoc, mkGivenLoc,
35
    ctWantedLoc,
36

37
    TcS, runTcS, failTcS, panicTcS, traceTcS, -- Basic functionality 
38
39
40
41
    traceFireTcS, bumpStepCountTcS, doWithInert,
    tryTcS, nestImplicTcS, recoverTcS,
    wrapErrTcS, wrapWarnTcS,

42
    SimplContext(..), isInteractive, performDefaulting,
43

dimitris's avatar
dimitris committed
44
45
46
    -- Getting and setting the flattening cache
    getFlatCache, updFlatCache, addToSolved, 
    
47
    deferTcSForAllEq, 
dimitris's avatar
dimitris committed
48
49
50
51
52
53
54
55
56
57
    
    setEvBind,
    XEvTerm(..),
    MaybeNew (..), isFresh,
    xCtFlavor, -- Transform a CtFlavor during a step 
    rewriteCtFlavor,          -- Specialized version of xCtFlavor for coercions
    newWantedEvVar, newGivenEvVar, instDFunConstraints, newKindConstraint,
    newDerived,
    xCtFlavor_cache, rewriteCtFlavor_cache,
    
58
       -- Creation of evidence variables
59
60
    setWantedTyBind,

61
    getInstEnvs, getFamInstEnvs,                -- Getting the environments
62
    getTopEnv, getGblEnv, getTcEvBinds, getUntouchables,
63
    getTcEvBindsMap, getTcSContext, getTcSTyBinds, getTcSTyBindsMap,
64

65
66

    newFlattenSkolemTy,                         -- Flatten skolems 
67

68
        -- Inerts 
dimitris's avatar
dimitris committed
69
    InertSet(..), InertCans(..), 
70
    getInertEqs, getCtCoercion,
71
    emptyInert, getTcSInerts, lookupInInerts, updInertSet, extractUnsolved,
72
73
74
    extractUnsolvedTcS, modifyInertTcS,
    updInertSetTcS, partitionCCanMap, partitionEqMap,
    getRelevantCts, extractRelevantInerts,
dimitris's avatar
dimitris committed
75
76
    CCanMap (..), CtTypeMap, CtFamHeadMap(..), CtPredMap(..),
    pprCtTypeMap, partCtFamHeadMap,
77

78

79
    instDFunType,                              -- Instantiation
80
    newFlexiTcSTy, instFlexiTcS,
81

82
    compatKind, mkKindErrorCtxtTcS,
83

84
    TcsUntouchables,
85
    isTouchableMetaTyVar,
86
    isTouchableMetaTyVar_InRange, 
87
88
89
90
91
92

    getDefaultInfo, getDynFlags,

    matchClass, matchFam, MatchInstResult (..), 
    checkWellStagedDFun, 
    warnTcS,
93
    pprEq                                    -- Smaller utils, re-exported from TcM
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
                                             -- TODO (DV): these are only really used in the 
                                             -- instance matcher in TcSimplify. I am wondering
                                             -- if the whole instance matcher simply belongs
                                             -- here 
) where 

#include "HsVersions.h"

import HscTypes
import BasicTypes 

import Inst
import InstEnv 
import FamInst 
import FamInstEnv

import qualified TcRnMonad as TcM
import qualified TcMType as TcM
import qualified TcEnv as TcM 
113
       ( checkWellStaged, topIdLvl, tcGetDefaultTys )
114
import {-# SOURCE #-} qualified TcUnify as TcM ( mkKindErrorCtxt )
115
import Kind
116
117
import TcType
import DynFlags
118
import Type
119

120
import TcEvidence
121
122
import Class
import TyCon
123

124
125
import Name
import Var
126
import VarEnv
127
128
129
130
import Outputable
import Bag
import MonadUtils
import VarSet
131

132
import FastString
Ian Lynagh's avatar
Ian Lynagh committed
133
import Util
134
import Id 
Ian Lynagh's avatar
Ian Lynagh committed
135
import TcRnTypes
136

137
138
139
140
import Unique 
import UniqFM
import Maybes ( orElse )

141

142
143
import Control.Monad( when )
import StaticFlags( opt_PprStyle_Debug )
Ian Lynagh's avatar
Ian Lynagh committed
144
import Data.IORef
dimitris's avatar
dimitris committed
145
146
import Data.List ( find )
import Control.Monad ( zipWithM )
147
import TrieMap
148

149
\end{code}
150

151

152
\begin{code}
153
compatKind :: Kind -> Kind -> Bool
Simon Peyton Jones's avatar
Simon Peyton Jones committed
154
compatKind k1 k2 = k1 `tcIsSubKind` k2 || k2 `tcIsSubKind` k1 
155

156
157
158
159
160
161
mkKindErrorCtxtTcS :: Type -> Kind 
                   -> Type -> Kind 
                   -> ErrCtxt
mkKindErrorCtxtTcS ty1 ki1 ty2 ki2
  = (False,TcM.mkKindErrorCtxt ty1 ty2 ki1 ki2)

162
163
\end{code}

164
165
166
167
168
169
170
171
%************************************************************************
%*									*
%*                            Worklists                                *
%*  Canonical and non-canonical constraints that the simplifier has to  *
%*  work on. Including their simplification depths.                     *
%*                                                                      *
%*									*
%************************************************************************
172

173
174
Note [WorkList]
~~~~~~~~~~~~~~~
175

176
177
178
A WorkList contains canonical and non-canonical items (of all flavors). 
Notice that each Ct now has a simplification depth. We may 
consider using this depth for prioritization as well in the future. 
179

180
181
182
183
184
As a simple form of priority queue, our worklist separates out
equalities (wl_eqs) from the rest of the canonical constraints, 
so that it's easier to deal with them first, but the separation 
is not strictly necessary. Notice that non-canonical constraints 
are also parts of the worklist. 
185

186
187
188
189
190
191
Note [NonCanonical Semantics]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Note that canonical constraints involve a CNonCanonical constructor. In the worklist
we use this constructor for constraints that have not yet been canonicalized such as 
   [Int] ~ [a] 
In other words, all constraints start life as NonCanonicals. 
192

193
194
On the other hand, in the Inert Set (see below) the presence of a NonCanonical somewhere
means that we have a ``frozen error''. 
195

196
197
198
NonCanonical constraints never interact directly with other constraints -- but they can
be rewritten by equalities (for instance if a non canonical exists in the inert, we'd 
better rewrite it as much as possible before reporting it as an error to the user)
199

200
\begin{code}
201

202
-- See Note [WorkList]
203
204
205
206
data WorkList = WorkList { wl_eqs    :: [Ct]
                         , wl_funeqs :: [Ct]
                         , wl_rest   :: [Ct] 
                         }
207

batterseapower's avatar
batterseapower committed
208

209
210
unionWorkList :: WorkList -> WorkList -> WorkList
unionWorkList new_wl orig_wl = 
dimitris's avatar
dimitris committed
211
212
213
   WorkList { wl_eqs    = wl_eqs new_wl ++ wl_eqs orig_wl
            , wl_funeqs = wl_funeqs new_wl ++ wl_funeqs orig_wl
            , wl_rest   = wl_rest new_wl ++ wl_rest orig_wl }
214

215

216
217
extendWorkListEq :: Ct -> WorkList -> WorkList
-- Extension by equality
dimitris's avatar
dimitris committed
218
219
220
221
222
extendWorkListEq ct wl 
  | Just {} <- isCFunEqCan_Maybe ct
  = wl { wl_funeqs = ct : wl_funeqs wl }
  | otherwise
  = wl { wl_eqs = ct : wl_eqs wl }
223

224
225
extendWorkListNonEq :: Ct -> WorkList -> WorkList
-- Extension by non equality
226
227
extendWorkListNonEq ct wl 
  = wl { wl_rest = ct : wl_rest wl }
228

229
230
231
extendWorkListCt :: Ct -> WorkList -> WorkList
-- Agnostic
extendWorkListCt ct wl
dimitris's avatar
dimitris committed
232
 | isEqPred (ctPred ct) = extendWorkListEq ct wl
233
 | otherwise = extendWorkListNonEq ct wl
234

235
236
237
appendWorkListCt :: [Ct] -> WorkList -> WorkList
-- Agnostic
appendWorkListCt cts wl = foldr extendWorkListCt wl cts
238

239
240
241
appendWorkListEqs :: [Ct] -> WorkList -> WorkList
-- Append a list of equalities
appendWorkListEqs cts wl = foldr extendWorkListEq wl cts
242
243

isEmptyWorkList :: WorkList -> Bool
dimitris's avatar
dimitris committed
244
245
isEmptyWorkList wl 
  = null (wl_eqs wl) &&  null (wl_rest wl) && null (wl_funeqs wl)
246
247

emptyWorkList :: WorkList
248
emptyWorkList = WorkList { wl_eqs  = [], wl_rest = [], wl_funeqs = [] }
249

250
workListFromEq :: Ct -> WorkList
dimitris's avatar
dimitris committed
251
workListFromEq ct = extendWorkListEq ct emptyWorkList
252

253
workListFromNonEq :: Ct -> WorkList
dimitris's avatar
dimitris committed
254
workListFromNonEq ct = extendWorkListNonEq ct emptyWorkList
255

256
257
workListFromCt :: Ct -> WorkList
-- Agnostic 
dimitris's avatar
dimitris committed
258
259
workListFromCt ct | isEqPred (ctPred ct) = workListFromEq ct 
                  | otherwise            = workListFromNonEq ct
260

dimitris's avatar
dimitris committed
261
262
263
264
265
266
267
268
269

selectWorkItem :: WorkList -> (Maybe Ct, WorkList)
selectWorkItem wl@(WorkList { wl_eqs = eqs, wl_funeqs = feqs, wl_rest = rest })
  = case (eqs,feqs,rest) of
      (ct:cts,_,_)     -> (Just ct, wl { wl_eqs    = cts })
      (_,(ct:cts),_)   -> (Just ct, wl { wl_funeqs = cts })
      (_,_,(ct:cts))   -> (Just ct, wl { wl_rest   = cts })
      (_,_,_)          -> (Nothing,wl)

270
271
272
-- Pretty printing 
instance Outputable WorkList where 
  ppr wl = vcat [ text "WorkList (eqs)   = " <+> ppr (wl_eqs wl)
dimitris's avatar
dimitris committed
273
                , text "WorkList (funeqs)= " <+> ppr (wl_funeqs wl)
274
275
                , text "WorkList (rest)  = " <+> ppr (wl_rest wl)
                ]
276

277
278
279
280
281
keepWanted :: Cts -> Cts
keepWanted = filterBag isWantedCt
    -- DV: there used to be a note here that read: 
    -- ``Important: use fold*r*Bag to preserve the order of the evidence variables'' 
    -- DV: Is this still relevant? 
282

dimitris's avatar
dimitris committed
283
-- Canonical constraint maps
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
data CCanMap a = CCanMap { cts_given   :: UniqFM Cts
                                          -- Invariant: all Given
                         , cts_derived :: UniqFM Cts 
                                          -- Invariant: all Derived
                         , cts_wanted  :: UniqFM Cts } 
                                          -- Invariant: all Wanted

cCanMapToBag :: CCanMap a -> Cts 
cCanMapToBag cmap = foldUFM unionBags rest_wder (cts_given cmap)
  where rest_wder = foldUFM unionBags rest_der  (cts_wanted cmap) 
        rest_der  = foldUFM unionBags emptyCts  (cts_derived cmap)

emptyCCanMap :: CCanMap a 
emptyCCanMap = CCanMap { cts_given = emptyUFM, cts_derived = emptyUFM, cts_wanted = emptyUFM } 

updCCanMap:: Uniquable a => (a,Ct) -> CCanMap a -> CCanMap a 
updCCanMap (a,ct) cmap 
  = case cc_flavor ct of 
      Wanted {}  -> cmap { cts_wanted  = insert_into (cts_wanted cmap)  } 
      Given {}   -> cmap { cts_given   = insert_into (cts_given cmap)   }
      Derived {} -> cmap { cts_derived = insert_into (cts_derived cmap) }
dimitris's avatar
dimitris committed
305
      Solved {}  -> panic "updCCanMap update with solved!" 
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
  where 
    insert_into m = addToUFM_C unionBags m a (singleCt ct)

getRelevantCts :: Uniquable a => a -> CCanMap a -> (Cts, CCanMap a) 
-- Gets the relevant constraints and returns the rest of the CCanMap
getRelevantCts a cmap 
    = let relevant = lookup (cts_wanted cmap) `unionBags`
                     lookup (cts_given cmap)  `unionBags`
                     lookup (cts_derived cmap) 
          residual_map = cmap { cts_wanted  = delFromUFM (cts_wanted cmap) a
                              , cts_given   = delFromUFM (cts_given cmap) a
                              , cts_derived = delFromUFM (cts_derived cmap) a }
      in (relevant, residual_map) 
  where
    lookup map = lookupUFM map a `orElse` emptyCts

dimitris's avatar
dimitris committed
322
323
324
325
326
327
lookupCCanMap :: Uniquable a => a -> (Ct -> Bool) -> CCanMap a -> Maybe Ct
lookupCCanMap a p map
   = let possible_cts = lookupUFM (cts_given map)   a `orElse` 
                        lookupUFM (cts_wanted map)  a `orElse` 
                        lookupUFM (cts_derived map) a `orElse` emptyCts
     in find p (bagToList possible_cts)
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343


partitionCCanMap :: (Ct -> Bool) -> CCanMap a -> (Cts,CCanMap a) 
-- All constraints that /match/ the predicate go in the bag, the rest remain in the map
partitionCCanMap pred cmap
  = let (ws_map,ws) = foldUFM_Directly aux (emptyUFM,emptyCts) (cts_wanted cmap) 
        (ds_map,ds) = foldUFM_Directly aux (emptyUFM,emptyCts) (cts_derived cmap)
        (gs_map,gs) = foldUFM_Directly aux (emptyUFM,emptyCts) (cts_given cmap) 
    in (ws `andCts` ds `andCts` gs, cmap { cts_wanted  = ws_map
                                         , cts_given   = gs_map
                                         , cts_derived = ds_map }) 
  where aux k this_cts (mp,acc_cts) = (new_mp, new_acc_cts)
                                    where new_mp      = addToUFM mp k cts_keep
                                          new_acc_cts = acc_cts `andCts` cts_out
                                          (cts_out, cts_keep) = partitionBag pred this_cts

344
partitionEqMap :: (Ct -> Bool) -> TyVarEnv (Ct,TcCoercion) -> ([Ct], TyVarEnv (Ct,TcCoercion))
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
partitionEqMap pred isubst 
  = let eqs_out = foldVarEnv extend_if_pred [] isubst
        eqs_in  = filterVarEnv_Directly (\_ (ct,_) -> not (pred ct)) isubst
    in (eqs_out, eqs_in)
  where extend_if_pred (ct,_) cts = if pred ct then ct : cts else cts


extractUnsolvedCMap :: CCanMap a -> (Cts, CCanMap a)
-- Gets the wanted or derived constraints and returns a residual
-- CCanMap with only givens.
extractUnsolvedCMap cmap =
  let wntd = foldUFM unionBags emptyCts (cts_wanted cmap)
      derd = foldUFM unionBags emptyCts (cts_derived cmap)
  in (wntd `unionBags` derd, 
      cmap { cts_wanted = emptyUFM, cts_derived = emptyUFM })


dimitris's avatar
dimitris committed
362
-- Maps from PredTypes to Constraints
363
type CtTypeMap = TypeMap Ct
dimitris's avatar
dimitris committed
364
365
366
367
newtype CtPredMap = 
  CtPredMap { unCtPredMap :: CtTypeMap }       -- Indexed by TcPredType
newtype CtFamHeadMap = 
  CtFamHeadMap { unCtFamHeadMap :: CtTypeMap } -- Indexed by family head
368
369
370
371
372
373
374

pprCtTypeMap :: TypeMap Ct -> SDoc 
pprCtTypeMap ctmap = ppr (foldTM (:) ctmap [])

ctTypeMapCts :: TypeMap Ct -> Cts
ctTypeMapCts ctmap = foldTM (\ct cts -> extendCts cts ct) ctmap emptyCts

dimitris's avatar
dimitris committed
375
376
377
378
379
380
381
382
383
384

partCtFamHeadMap :: (Ct -> Bool) 
                 -> CtFamHeadMap 
                 -> (Cts, CtFamHeadMap)
partCtFamHeadMap f ctmap
  = let (cts,tymap_final) = foldTM upd_acc tymap_inside (emptyBag, tymap_inside)
    in (cts, CtFamHeadMap tymap_final)
  where
    tymap_inside = unCtFamHeadMap ctmap 
    upd_acc ct (cts,acc_map)
385
386
         | f ct      = (extendCts cts ct, alterTM ct_key (\_ -> Nothing) acc_map)
         | otherwise = (cts,acc_map)
dimitris's avatar
dimitris committed
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
         where ct_key | EqPred ty1 _ <- classifyPredType (ctPred ct)
                      = ty1 
                      | otherwise 
                      = panic "partCtFamHeadMap, encountered non equality!"


\end{code}

%************************************************************************
%*									*
%*                            Inert Sets                                *
%*                                                                      *
%*									*
%************************************************************************

\begin{code}


-- All Given (fully known) or Wanted or Derived, never Solved
-- See Note [Detailed InertCans Invariants] for more
data InertCans 
  = IC { inert_eqs :: TyVarEnv Ct
              -- Must all be CTyEqCans! If an entry exists of the form: 
              --   a |-> ct,co
              -- Then ct = CTyEqCan { cc_tyvar = a, cc_rhs = xi } 
              -- And  co : a ~ xi
       , inert_eq_tvs :: InScopeSet
              -- Superset of the type variables of inert_eqs
       , inert_dicts :: CCanMap Class
              -- Dictionaries only, index is the class
              -- NB: index is /not/ the whole type because FD reactions 
              -- need to match the class but not necessarily the whole type.
       , inert_ips :: CCanMap (IPName Name)
              -- Implicit parameters, index is the name
              -- NB: index is /not/ the whole type because IP reactions need 
              -- to match the ip name but not necessarily the whole type.
       , inert_funeqs :: CtFamHeadMap
              -- Family equations, index is the whole family head type.
       , inert_irreds :: Cts       
              -- Irreducible predicates
       }
    
                     
\end{code}

Note [Detailed InertCans Invariants]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The InertCans represents a collection of constraints with the following properties:
  1 All canonical
  2 All Given or Wanted or Derived. No (partially) Solved
  3 No two dictionaries with the same head
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
  4 No two family equations with the same head 
      NB: This is enforced by construction since we use a CtFamHeadMap for inert_funeqs
  5 Family equations inert wrt top-level family axioms
  6 Dictionaries have no matching top-level instance 
  
  7 Non-equality constraints are fully rewritten with respect to the equalities (CTyEqCan)

  8 Equalities _do_not_ form an idempotent substitution but they are guarranteed to not have
    any occurs errors. Additional notes: 

       - The lack of idempotence of the inert substitution implies that we must make sure 
         that when we rewrite a constraint we apply the substitution /recursively/ to the 
         types involved. Currently the one AND ONLY way in the whole constraint solver 
         that we rewrite types and constraints wrt to the inert substitution is 
         TcCanonical/flattenTyVar.

       - In the past we did try to have the inert substituion as idempotent as possible but
         this would only be true for constraints of the same flavor, so in total the inert 
         substitution could not be idempotent, due to flavor-related issued. 
         Note [Non-idempotent inert substitution] explains what is going on. 

       - Whenever a constraint ends up in the worklist we do recursively apply exhaustively
         the inert substitution to it to check for occurs errors but if an equality is already
         in the inert set and we can guarantee that adding a new equality will not cause the
         first equality to have an occurs check then we do not rewrite the inert equality. 
         This happens in TcInteract, rewriteInertEqsFromInertEq. 
         
         See Note [Delicate equality kick-out] to see which inert equalities can safely stay
         in the inert set and which must be kicked out to be rewritten and re-checked for 
         occurs errors. 

dimitris's avatar
dimitris committed
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
  9 Given family or dictionary constraints don't mention touchable unification variables
\begin{code}


-- The Inert Set
data InertSet
  = IS { inert_cans :: InertCans
              -- Canonical Given,Wanted,Solved
       , inert_frozen :: Cts       
              -- Frozen errors (as non-canonicals)
                               
       , inert_solved :: CtPredMap
              -- Solved constraints (for caching): 
              -- (i) key is by predicate type
              -- (ii) all of 'Solved' flavor, may or may not be canonicals
              -- (iii) we use this field for avoiding creating newEvVars
       , inert_flat_cache :: CtFamHeadMap 
              -- All ``flattening equations'' are kept here. 
              -- Always canonical CTyFunEqs (Given or Wanted only!)
              -- Key is by family head. We used this field during flattening only
       , inert_solved_funeqs :: CtFamHeadMap
490
              -- Memoized Solved family equations co :: F xis ~ xi
dimitris's avatar
dimitris committed
491
492
493
              -- Stored not necessarily as fully rewritten; we'll do that lazily
              -- when we lookup
       }
494
495


dimitris's avatar
dimitris committed
496
497
498
499
500
501
502
503
504
505
506
instance Outputable InertCans where 
  ppr ics = vcat [ vcat (map ppr (varEnvElts (inert_eqs ics)))
                 , vcat (map ppr (Bag.bagToList $ cCanMapToBag (inert_dicts ics)))
                 , vcat (map ppr (Bag.bagToList $ cCanMapToBag (inert_ips ics))) 
                 , vcat (map ppr (Bag.bagToList $ 
                                  ctTypeMapCts (unCtFamHeadMap $ inert_funeqs ics)))
                 , vcat (map ppr (Bag.bagToList $ inert_irreds ics))
                 ]
            
instance Outputable InertSet where 
  ppr is = vcat [ ppr $ inert_cans is
507
508
                , text "Frozen errors =" <+> -- Clearly print frozen errors
                    braces (vcat (map ppr (Bag.bagToList $ inert_frozen is)))
dimitris's avatar
dimitris committed
509
510
511
512
                , text "Solved and cached" <+>
                    int (foldTypeMap (\_ x -> x+1) 0 
                             (unCtPredMap $ inert_solved is)) <+> 
                    text "more constraints" ]
513

dimitris's avatar
dimitris committed
514
515
516
517
518
519
520
521
522
523
524
525
emptyInert :: InertSet
emptyInert
  = IS { inert_cans = IC { inert_eqs    = emptyVarEnv
                         , inert_eq_tvs = emptyInScopeSet
                         , inert_dicts  = emptyCCanMap
                         , inert_ips    = emptyCCanMap
                         , inert_funeqs = CtFamHeadMap emptyTM 
                         , inert_irreds = emptyCts }
       , inert_frozen        = emptyCts
       , inert_flat_cache    = CtFamHeadMap emptyTM
       , inert_solved        = CtPredMap emptyTM 
       , inert_solved_funeqs = CtFamHeadMap emptyTM }
526
527
528
529
530
531

type AtomicInert = Ct 

updInertSet :: InertSet -> AtomicInert -> InertSet 
-- Add a new inert element to the inert set. 
updInertSet is item 
dimitris's avatar
dimitris committed
532
533
534
535
536
537
538
539
540
541
542
543
544
  | isSolved (cc_flavor item)
    -- Solved items go in their special place
  = let pty = ctPred item
        upd_solved Nothing = Just item
        upd_solved (Just _existing_solved) = Just item 
               -- .. or Just existing_solved? Is this even possible to happen?
    in is { inert_solved = 
               CtPredMap $ 
               alterTM pty upd_solved (unCtPredMap $ inert_solved is) }

  | isCNonCanonical item 
    -- NB: this may happen if we decide to kick some frozen error 
    -- out to rewrite him. Frozen errors are just NonCanonicals
545
  = is { inert_frozen = inert_frozen is `Bag.snocBag` item }
dimitris's avatar
dimitris committed
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
573
574
575
576
577
578
579
580
581
582
583
584
585
586
    
  | otherwise  
    -- A canonical Given, Wanted, or Derived
  = is { inert_cans = upd_inert_cans (inert_cans is) item }
  
  where upd_inert_cans :: InertCans -> AtomicInert -> InertCans
        -- Precondition: item /is/ canonical
        upd_inert_cans ics item
          | isCTyEqCan item                     
          = let upd_err a b = pprPanic "updInertSet" $
                              vcat [ text "Multiple inert equalities:"
                                   , text "Old (already inert):" <+> ppr a
                                   , text "Trying to insert   :" <+> ppr b ]
        
                eqs'     = extendVarEnv_C upd_err (inert_eqs ics) 
                                                  (cc_tyvar item) item        
                inscope' = extendInScopeSetSet (inert_eq_tvs ics)
                                               (tyVarsOfCt item)
                
            in ics { inert_eqs = eqs', inert_eq_tvs = inscope' }

          | Just x  <- isCIPCan_Maybe item      -- IP 
          = ics { inert_ips   = updCCanMap (x,item) (inert_ips ics) }  
            
          | isCIrredEvCan item                  -- Presently-irreducible evidence
          = ics { inert_irreds = inert_irreds ics `Bag.snocBag` item }

          | Just cls <- isCDictCan_Maybe item   -- Dictionary 
          = ics { inert_dicts = updCCanMap (cls,item) (inert_dicts ics) }

          | Just _tc <- isCFunEqCan_Maybe item  -- Function equality
          = let fam_head = mkTyConApp (cc_fun item) (cc_tyargs item)
                upd_funeqs Nothing = Just item
                upd_funeqs (Just _already_there) 
                  = panic "updInertSet: item already there!"
            in ics { inert_funeqs = CtFamHeadMap 
                                      (alterTM fam_head upd_funeqs $ 
                                         (unCtFamHeadMap $ inert_funeqs ics)) }
          | otherwise
          = pprPanic "upd_inert set: can't happen! Inserting " $ 
            ppr item 
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607

updInertSetTcS :: AtomicInert -> TcS ()
-- Add a new item in the inerts of the monad
updInertSetTcS item
  = do { traceTcS "updInertSetTcs {" $ 
         text "Trying to insert new inert item:" <+> ppr item

       ; modifyInertTcS (\is -> ((), updInertSet is item)) 
                        
       ; traceTcS "updInertSetTcs }" $ empty }


modifyInertTcS :: (InertSet -> (a,InertSet)) -> TcS a 
-- Modify the inert set with the supplied function
modifyInertTcS upd 
  = do { is_var <- getTcSInertsRef
       ; curr_inert <- wrapTcS (TcM.readTcRef is_var)
       ; let (a, new_inert) = upd curr_inert
       ; wrapTcS (TcM.writeTcRef is_var new_inert)
       ; return a }

dimitris's avatar
dimitris committed
608
609

addToSolved :: Ct -> TcS ()
610
611
612
613
614
-- Don't do any caching for IP preds because of delicate shadowing
addToSolved ct
  | isIPPred (ctPred ct)  
  = return () 
  | otherwise
dimitris's avatar
dimitris committed
615
616
617
  = ASSERT ( isSolved (cc_flavor ct) )
    updInertSetTcS ct

618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
extractUnsolvedTcS :: TcS (Cts,Cts) 
-- Extracts frozen errors and remaining unsolved and sets the 
-- inert set to be the remaining! 
extractUnsolvedTcS = 
  modifyInertTcS extractUnsolved 

extractUnsolved :: InertSet -> ((Cts,Cts), InertSet)
-- Postcondition
-- -------------
-- When: 
--   ((frozen,cts),is_solved) <- extractUnsolved inert
-- Then: 
-- -----------------------------------------------------------------------------
--  cts       |  The unsolved (Derived or Wanted only) residual 
--            |  canonical constraints, that is, no CNonCanonicals.
-- -----------|-----------------------------------------------------------------
--  frozen    | The CNonCanonicals of the original inert (frozen errors), 
--            | of all flavors
-- -----------|-----------------------------------------------------------------
--  is_solved | Whatever remains from the inert after removing the previous two. 
-- -----------------------------------------------------------------------------
dimitris's avatar
dimitris committed
639
640
641
642
643
644
645
646
extractUnsolved (IS { inert_cans = IC { inert_eqs    = eqs
                                      , inert_eq_tvs = eq_tvs
                                      , inert_irreds = irreds
                                      , inert_ips    = ips
                                      , inert_funeqs = funeqs
                                      , inert_dicts  = dicts
                                      }
                    , inert_frozen = frozen
647
648
649
650
                    , inert_solved = solved
                    , inert_flat_cache = flat_cache 
                    , inert_solved_funeqs = funeq_cache
                    })
dimitris's avatar
dimitris committed
651
652
653
654
655
656
657
658
659
  
  = let is_solved  = IS { inert_cans = IC { inert_eqs    = solved_eqs
                                          , inert_eq_tvs = eq_tvs
                                          , inert_dicts  = solved_dicts
                                          , inert_ips    = solved_ips
                                          , inert_irreds = solved_irreds
                                          , inert_funeqs = solved_funeqs }
                        , inert_frozen = emptyCts -- All out
                                         
660
661
662
663
664
665
                              -- At some point, I used to flush all the solved, in 
                              -- fear of evidence loops. But I think we are safe, 
                              -- flushing is why T3064 had become slower
                        , inert_solved        = solved      -- CtPredMap emptyTM
                        , inert_flat_cache    = flat_cache  -- CtFamHeadMap emptyTM
                        , inert_solved_funeqs = funeq_cache -- CtFamHeadMap emptyTM
666
                        }
dimitris's avatar
dimitris committed
667
    in ((frozen, unsolved), is_solved)
668

dimitris's avatar
dimitris committed
669
670
  where solved_eqs = filterVarEnv_Directly (\_ ct -> isGivenOrSolvedCt ct) eqs
        unsolved_eqs = foldVarEnv (\ct cts -> cts `extendCts` ct) emptyCts $
671
672
673
                       eqs `minusVarEnv` solved_eqs

        (unsolved_irreds, solved_irreds) = Bag.partitionBag (not.isGivenOrSolvedCt) irreds
dimitris's avatar
dimitris committed
674
675
        (unsolved_ips, solved_ips)       = extractUnsolvedCMap ips
        (unsolved_dicts, solved_dicts)   = extractUnsolvedCMap dicts
676

dimitris's avatar
dimitris committed
677
678
        (unsolved_funeqs, solved_funeqs) = 
          partCtFamHeadMap (not . isGivenOrSolved . cc_flavor) funeqs
679
680
681
682
683
684
685
686
687
688
689

        unsolved = unsolved_eqs `unionBags` unsolved_irreds `unionBags`
                   unsolved_ips `unionBags` unsolved_dicts `unionBags` unsolved_funeqs



extractRelevantInerts :: Ct -> TcS Cts
-- Returns the constraints from the inert set that are 'relevant' to react with 
-- this constraint. The monad is left with the 'thinner' inerts. 
-- NB: This function contains logic specific to the constraint solver, maybe move there?
extractRelevantInerts wi 
dimitris's avatar
dimitris committed
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
  = modifyInertTcS (extract_relevants wi)
  where extract_relevants wi is 
          = let (cts,ics') = extract_ics_relevants wi (inert_cans is)
            in (cts, is { inert_cans = ics' }) 
            
        extract_ics_relevants (CDictCan {cc_class = cl}) ics = 
            let (cts,dict_map) = getRelevantCts cl (inert_dicts ics) 
            in (cts, ics { inert_dicts = dict_map })
        extract_ics_relevants ct@(CFunEqCan {}) ics = 
            let (cts,feqs_map)  = 
                  let funeq_map = unCtFamHeadMap $ inert_funeqs ics
                      fam_head = mkTyConApp (cc_fun ct) (cc_tyargs ct)
                      lkp = lookupTM fam_head funeq_map
                      new_funeq_map = alterTM fam_head xtm funeq_map
                      xtm Nothing    = Nothing
                      xtm (Just _ct) = Nothing
                  in case lkp of 
                    Nothing -> (emptyCts, funeq_map)
                    Just ct -> (singleCt ct, new_funeq_map)
            in (cts, ics { inert_funeqs = CtFamHeadMap feqs_map })
        extract_ics_relevants (CIPCan { cc_ip_nm = nm } ) ics = 
            let (cts, ips_map) = getRelevantCts nm (inert_ips ics) 
            in (cts, ics { inert_ips = ips_map })
        extract_ics_relevants (CIrredEvCan { }) ics = 
            let cts = inert_irreds ics 
            in (cts, ics { inert_irreds = emptyCts })
        extract_ics_relevants _ ics = (emptyCts,ics)
        

lookupInInerts :: InertSet -> TcPredType -> Maybe Ct
-- Is this exact predicate type cached in the solved or canonicals of the InertSet
lookupInInerts (IS { inert_solved = solved, inert_cans = ics }) pty
  = case lookupInSolved solved pty of
      Just ct -> return ct
      Nothing -> lookupInInertCans ics pty

lookupInSolved :: CtPredMap -> TcPredType -> Maybe Ct
-- Returns just if exactly this predicate type exists in the solved.
lookupInSolved tm pty = lookupTM pty $ unCtPredMap tm

lookupInInertCans :: InertCans -> TcPredType -> Maybe Ct
-- Returns Just if exactly this pred type exists in the inert canonicals
lookupInInertCans ics pty
  = lkp_ics (classifyPredType pty)
  where lkp_ics (ClassPred cls _)
          = lookupCCanMap cls (\ct -> ctPred ct `eqType` pty) (inert_dicts ics)
        lkp_ics (EqPred ty1 _ty2)
          | Just tv <- getTyVar_maybe ty1
          , Just ct <- lookupVarEnv (inert_eqs ics) tv
          , ctPred ct `eqType` pty
          = Just ct
        lkp_ics (EqPred ty1 _ty2) -- Family equation
          | Just _ <- splitTyConApp_maybe ty1
          , Just ct <- lookupTM ty1 (unCtFamHeadMap $ inert_funeqs ics)
          , ctPred ct `eqType` pty
          = Just ct
        lkp_ics (IrredPred {}) 
          = find (\ct -> ctPred ct `eqType` pty) (bagToList (inert_irreds ics))
        lkp_ics _ = Nothing -- NB: No caching for IPs
749
750
\end{code}

751

dimitris's avatar
dimitris committed
752
753


754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
%************************************************************************
%*									*
%*		The TcS solver monad                                    *
%*									*
%************************************************************************

Note [The TcS monad]
~~~~~~~~~~~~~~~~~~~~
The TcS monad is a weak form of the main Tc monad

All you can do is
    * fail
    * allocate new variables
    * fill in evidence variables

Filling in a dictionary evidence variable means to create a binding
for it, so TcS carries a mutable location where the binding can be
added.  This is initialised from the innermost implication constraint.

\begin{code}
data TcSEnv
  = TcSEnv { 
776
      tcs_ev_binds    :: EvBindsVar,
dimitris's avatar
dimitris committed
777
      
778
      tcs_ty_binds :: IORef (TyVarEnv (TcTyVar, TcType)),
779
780
          -- Global type bindings

781
      tcs_context :: SimplContext,
782
                     
783
784
      tcs_untch :: TcsUntouchables,

dimitris's avatar
dimitris committed
785
786
787
      tcs_ic_depth   :: Int,       -- Implication nesting depth
      tcs_count      :: IORef Int, -- Global step count

788
      tcs_inerts   :: IORef InertSet, -- Current inert set
789
790
791
792
793
      tcs_worklist :: IORef WorkList, -- Current worklist
      
      -- Residual implication constraints that are generated 
      -- while solving the current worklist.
      tcs_implics  :: IORef (Bag Implication)
794
    }
dimitris's avatar
dimitris committed
795

796
797
798
799
type TcsUntouchables = (Untouchables,TcTyVarSet)
-- Like the TcM Untouchables, 
-- but records extra TcsTv variables generated during simplification
-- See Note [Extra TcsTv untouchables] in TcSimplify
800
801
802
\end{code}

\begin{code}
803
data SimplContext
804
805
806
  = SimplInfer SDoc	   -- Inferring type of a let-bound thing
  | SimplInteractive	   -- Inferring type at GHCi prompt
  | SimplCheck SDoc	   -- Checking a type signature or RULE rhs
807
808

instance Outputable SimplContext where
809
810
  ppr (SimplInfer d)   = ptext (sLit "SimplInfer") <+> d
  ppr (SimplCheck d)   = ptext (sLit "SimplCheck") <+> d
811
812
813
814
815
816
817
  ppr SimplInteractive = ptext (sLit "SimplInteractive")

isInteractive :: SimplContext -> Bool
isInteractive SimplInteractive = True
isInteractive _                = False

performDefaulting :: SimplContext -> Bool
818
819
820
performDefaulting (SimplInfer {})   = False
performDefaulting SimplInteractive  = True
performDefaulting (SimplCheck {})   = True
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855

---------------
newtype TcS a = TcS { unTcS :: TcSEnv -> TcM a } 

instance Functor TcS where
  fmap f m = TcS $ fmap f . unTcS m

instance Monad TcS where 
  return x  = TcS (\_ -> return x) 
  fail err  = TcS (\_ -> fail err) 
  m >>= k   = TcS (\ebs -> unTcS m ebs >>= \r -> unTcS (k r) ebs)

-- Basic functionality 
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wrapTcS :: TcM a -> TcS a 
-- Do not export wrapTcS, because it promotes an arbitrary TcM to TcS,
-- and TcS is supposed to have limited functionality
wrapTcS = TcS . const -- a TcM action will not use the TcEvBinds

wrapErrTcS :: TcM a -> TcS a 
-- The thing wrapped should just fail
-- There's no static check; it's up to the user
-- Having a variant for each error message is too painful
wrapErrTcS = wrapTcS

wrapWarnTcS :: TcM a -> TcS a 
-- The thing wrapped should just add a warning, or no-op
-- There's no static check; it's up to the user
wrapWarnTcS = wrapTcS

failTcS, panicTcS :: SDoc -> TcS a
failTcS      = wrapTcS . TcM.failWith
panicTcS doc = pprPanic "TcCanonical" doc

traceTcS :: String -> SDoc -> TcS ()
856
traceTcS herald doc = wrapTcS (TcM.traceTc herald doc)
857

858
859
860
861
862
bumpStepCountTcS :: TcS ()
bumpStepCountTcS = TcS $ \env -> do { let ref = tcs_count env
                                    ; n <- TcM.readTcRef ref
                                    ; TcM.writeTcRef ref (n+1) }

863
traceFireTcS :: SubGoalDepth -> SDoc -> TcS ()
864
865
866
867
868
869
870
871
872
-- Dump a rule-firing trace
traceFireTcS depth doc 
  = TcS $ \env -> 
    TcM.ifDOptM Opt_D_dump_cs_trace $ 
    do { n <- TcM.readTcRef (tcs_count env)
       ; let msg = int n 
                <> text (replicate (tcs_ic_depth env) '>')
                <> brackets (int depth) <+> doc
       ; TcM.dumpTcRn msg }
873
874

runTcS :: SimplContext
875
       -> Untouchables 	       -- Untouchables
876
877
       -> InertSet             -- Initial inert set
       -> WorkList             -- Initial work list
878
       -> TcS a		       -- What to run
879
       -> TcM (a, Bag EvBind)
880
runTcS context untouch is wl tcs 
881
  = do { ty_binds_var <- TcM.newTcRef emptyVarEnv
882
       ; ev_binds_var <- TcM.newTcEvBinds
883
       ; impl_var <- TcM.newTcRef emptyBag
884
       ; step_count <- TcM.newTcRef 0
885
886
887
888

       ; inert_var <- TcM.newTcRef is 
       ; wl_var <- TcM.newTcRef wl

889
890
       ; let env = TcSEnv { tcs_ev_binds = ev_binds_var
                          , tcs_ty_binds = ty_binds_var
891
                          , tcs_context  = context
892
                          , tcs_untch    = (untouch, emptyVarSet) -- No Tcs untouchables yet
893
894
			  , tcs_count    = step_count
			  , tcs_ic_depth = 0
895
                          , tcs_inerts   = inert_var
896
897
                          , tcs_worklist = wl_var 
                          , tcs_implics  = impl_var }
898
899

	     -- Run the computation
900
       ; res <- unTcS tcs env
901
902
	     -- Perform the type unifications required
       ; ty_binds <- TcM.readTcRef ty_binds_var
903
       ; mapM_ do_unification (varEnvElts ty_binds)
904

Ian Lynagh's avatar
Ian Lynagh committed
905
906
907
908
909
910
       ; when debugIsOn $ do {
             count <- TcM.readTcRef step_count
           ; when (opt_PprStyle_Debug && count > 0) $
             TcM.debugDumpTcRn (ptext (sLit "Constraint solver steps =") 
                                <+> int count <+> ppr context)
         }
911
             -- And return
912
913
       ; ev_binds <- TcM.getTcEvBinds ev_binds_var
       ; return (res, ev_binds) }
914
915
  where
    do_unification (tv,ty) = TcM.writeMetaTyVar tv ty
916

917
918
919
920

doWithInert :: InertSet -> TcS a -> TcS a 
doWithInert inert (TcS action)
  = TcS $ \env -> do { new_inert_var <- TcM.newTcRef inert
dimitris's avatar
dimitris committed
921
                     ; action (env { tcs_inerts = new_inert_var }) }
922
923
924
925
926
927
928
929
930

nestImplicTcS :: EvBindsVar -> TcsUntouchables -> TcS a -> TcS a 
nestImplicTcS ref (inner_range, inner_tcs) (TcS thing_inside) 
  = TcS $ \ TcSEnv { tcs_ty_binds = ty_binds
                   , tcs_untch = (_outer_range, outer_tcs)
                   , tcs_count = count
                   , tcs_ic_depth = idepth
                   , tcs_context = ctxt
                   , tcs_inerts = inert_var
931
932
                   , tcs_worklist = wl_var 
                   , tcs_implics = _impl_var } -> 
dimitris's avatar
dimitris committed
933
    do { let inner_untch = (inner_range, outer_tcs `unionVarSet` inner_tcs)
934
935
936
937
       		   -- The inner_range should be narrower than the outer one
		   -- (thus increasing the set of untouchables) but 
		   -- the inner Tcs-untouchables must be unioned with the
		   -- outer ones!
dimitris's avatar
dimitris committed
938

939
940
941
         -- Inherit the inerts from the outer scope
       ; orig_inerts <- TcM.readTcRef inert_var
       ; new_inert_var <- TcM.newTcRef orig_inerts
942
943
944
945
         -- Inherit residual implications from outer scope (?) or create
         -- fresh var?                 
--     ; orig_implics <- TcM.readTcRef impl_var                   
       ; new_implics_var <- TcM.newTcRef emptyBag
dimitris's avatar
dimitris committed
946
                           
947
948
949
950
951
       ; let nest_env = TcSEnv { tcs_ev_binds    = ref
                               , tcs_ty_binds    = ty_binds
                               , tcs_untch       = inner_untch
                               , tcs_count       = count
                               , tcs_ic_depth    = idepth+1
952
                               , tcs_context     = ctxt 
953
954
955
956
                               , tcs_inerts      = new_inert_var
                               , tcs_worklist    = wl_var 
                               -- NB: worklist is going to be empty anyway, 
                               -- so reuse the same ref cell
957
                               , tcs_implics     = new_implics_var
958
959
                               }
       ; thing_inside nest_env } 
960

961
962
963
964
965
recoverTcS :: TcS a -> TcS a -> TcS a
recoverTcS (TcS recovery_code) (TcS thing_inside)
  = TcS $ \ env ->
    TcM.recoverM (recovery_code env) (thing_inside env)

966
tryTcS :: TcS a -> TcS a
967
968
969
-- Like runTcS, but from within the TcS monad 
-- Completely afresh inerts and worklist, be careful! 
-- Moreover, we will simply throw away all the evidence generated. 
dimitris's avatar
dimitris committed
970
tryTcS tcs
971
972
973
974
975
976
977
978
979
980
981
982
983
984
  = TcS (\env -> 
             do { wl_var <- TcM.newTcRef emptyWorkList
                ; is_var <- TcM.newTcRef emptyInert

                ; ty_binds_var <- TcM.newTcRef emptyVarEnv
                ; ev_binds_var <- TcM.newTcEvBinds

                ; let env1 = env { tcs_ev_binds = ev_binds_var
                                 , tcs_ty_binds = ty_binds_var
                                 , tcs_inerts   = is_var
                                 , tcs_worklist = wl_var } 
                ; unTcS tcs env1 })

-- Getters and setters of TcEnv fields
985
986
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

987
988
989
990
991
992
993
994
995
996
-- Getter of inerts and worklist
getTcSInertsRef :: TcS (IORef InertSet)
getTcSInertsRef = TcS (return . tcs_inerts)

getTcSWorkListRef :: TcS (IORef WorkList) 
getTcSWorkListRef = TcS (return . tcs_worklist) 

getTcSInerts :: TcS InertSet 
getTcSInerts = getTcSInertsRef >>= wrapTcS . (TcM.readTcRef) 

997
998
999
1000
1001
1002
1003

getTcSImplicsRef :: TcS (IORef (Bag Implication))
getTcSImplicsRef = TcS (return . tcs_implics) 

getTcSImplics :: TcS (Bag Implication)
getTcSImplics = getTcSImplicsRef >>= wrapTcS . (TcM.readTcRef)

1004
1005
1006
getTcSWorkList :: TcS WorkList
getTcSWorkList = getTcSWorkListRef >>= wrapTcS . (TcM.readTcRef) 

1007
1008
1009
1010
1011
1012
1013
1014
1015
1016

getTcSWorkListTvs :: TcS TyVarSet
-- Return the variables of the worklist
getTcSWorkListTvs 
  = do { wl <- getTcSWorkList
       ; return $
         cts_tvs (wl_eqs wl) `unionVarSet` cts_tvs (wl_funeqs wl) `unionVarSet` cts_tvs (wl_rest wl) }
  where cts_tvs = foldr (unionVarSet . tyVarsOfCt) emptyVarSet 


1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
updWorkListTcS :: (WorkList -> WorkList) -> TcS () 
updWorkListTcS f 
  = updWorkListTcS_return (\w -> ((),f w))

updWorkListTcS_return :: (WorkList -> (a,WorkList)) -> TcS a
updWorkListTcS_return f
  = do { wl_var <- getTcSWorkListRef
       ; wl_curr <- wrapTcS (TcM.readTcRef wl_var)
       ; let (res,new_work) = f wl_curr
       ; wrapTcS (TcM.writeTcRef wl_var new_work)
       ; return res }
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
    

updTcSImplics :: (Bag Implication -> Bag Implication) -> TcS ()
updTcSImplics f 
 = do { impl_ref <- getTcSImplicsRef
      ; implics <- wrapTcS (TcM.readTcRef impl_ref)
      ; let new_implics = f implics
      ; wrapTcS (TcM.writeTcRef impl_ref new_implics) }

emitTcSImplication :: Implication -> TcS ()
emitTcSImplication imp = updTcSImplics (consBag imp)

1040

dimitris's avatar
dimitris committed
1041
emitFrozenError :: CtFlavor -> SubGoalDepth -> TcS ()
1042
-- Emits a non-canonical constraint that will stand for a frozen error in the inerts. 
dimitris's avatar
dimitris committed
1043
1044
emitFrozenError fl depth 
  = do { traceTcS "Emit frozen error" (ppr (ctFlavPred fl))
1045
1046
       ; inert_ref <- getTcSInertsRef 
       ; inerts <- wrapTcS (TcM.readTcRef inert_ref)
dimitris's avatar
dimitris committed
1047
       ; let ct = CNonCanonical { cc_flavor = fl
1048
1049
1050
1051
                                , cc_depth = depth } 
             inerts_new = inerts { inert_frozen = extendCts (inert_frozen inerts) ct } 
       ; wrapTcS (TcM.writeTcRef inert_ref inerts_new) }

1052
instance HasDynFlags TcS where
1053
    getDynFlags = wrapTcS getDynFlags
1054
1055
1056
1057
1058
1059
1060

getTcSContext :: TcS SimplContext
getTcSContext = TcS (return . tcs_context)

getTcEvBinds :: TcS EvBindsVar
getTcEvBinds = TcS (return . tcs_ev_binds) 

dimitris's avatar
dimitris committed
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
getFlatCache :: TcS CtTypeMap 
getFlatCache = getTcSInerts >>= (return . unCtFamHeadMap . inert_flat_cache)

updFlatCache :: Ct -> TcS ()
-- Pre: constraint is a flat family equation (equal to a flatten skolem)
updFlatCache flat_eq@(CFunEqCan { cc_flavor = fl, cc_fun = tc, cc_tyargs = xis })
  = modifyInertTcS upd_inert_cache
  where upd_inert_cache is = ((), is { inert_flat_cache = CtFamHeadMap new_fc })
                           where new_fc = alterTM pred_key upd_cache fc
                                 fc = unCtFamHeadMap $ inert_flat_cache is
        pred_key = mkTyConApp tc xis
        upd_cache (Just ct) | cc_flavor ct `canSolve` fl = Just ct 
        upd_cache (Just _ct) = Just flat_eq 
        upd_cache Nothing    = Just flat_eq
updFlatCache other_ct = pprPanic "updFlatCache: non-family constraint" $
                        ppr other_ct
                        
1078
1079


1080
getUntouchables :: TcS TcsUntouchables
1081
1082
getUntouchables = TcS (return . tcs_untch)

1083
getTcSTyBinds :: TcS (IORef (TyVarEnv (TcTyVar, TcType)))
1084
1085
getTcSTyBinds = TcS (return . tcs_ty_binds)

1086
getTcSTyBindsMap :: TcS (TyVarEnv (TcTyVar, TcType))
1087
getTcSTyBindsMap = getTcSTyBinds >>= wrapTcS . (TcM.readTcRef) 
1088

1089
1090
getTcEvBindsMap :: TcS EvBindMap
getTcEvBindsMap
1091
1092
1093
1094
1095
  = do { EvBindsVar ev_ref _ <- getTcEvBinds 
       ; wrapTcS $ TcM.readTcRef ev_ref }

setWantedTyBind :: TcTyVar -> TcType -> TcS () 
-- Add a type binding
1096
-- We never do this twice!
1097
1098
1099
1100
setWantedTyBind tv ty 
  = do { ref <- getTcSTyBinds
       ; wrapTcS $ 
         do { ty_binds <- TcM.readTcRef ref
Ian Lynagh's avatar
Ian Lynagh committed
1101
1102
1103
1104
1105
            ; when debugIsOn $
                  TcM.checkErr (not (tv `elemVarEnv` ty_binds)) $
                  vcat [ text "TERRIBLE ERROR: double set of meta type variable"
                       , ppr tv <+> text ":=" <+> ppr ty
                       , text "Old value =" <+> ppr (lookupVarEnv_NF ty_binds tv)]
1106
            ; TcM.writeTcRef ref (extendVarEnv ty_binds tv (tv,ty)) } }
1107
1108


1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
\end{code}
Note [Optimizing Spontaneously Solved Coercions]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 

Spontaneously solved coercions such as alpha := tau used to be bound as everything else
in the evidence binds. Subsequently they were used for rewriting other wanted or solved
goals. For instance: 

WorkItem = [S] g1 : a ~ tau
Inerts   = [S] g2 : b ~ [a]
           [S] g3 : c ~ [(a,a)]

Would result, eventually, after the workitem rewrites the inerts, in the
following evidence bindings:

        g1 = ReflCo tau
        g2 = ReflCo [a]
        g3 = ReflCo [(a,a)]
        g2' = g2 ; [g1] 
        g3' = g3 ; [(g1,g1)]

This ia annoying because it puts way too much stress to the zonker and
desugarer, since we /know/ at the generation time (spontaneously
solving) that the evidence for a particular evidence variable is the
identity.

For this reason, our solution is to cache inside the GivenSolved
flavor of a constraint the term which is actually solving this
constraint. Whenever we perform a setEvBind, a new flavor is returned
so that if it was a GivenSolved to start with, it remains a
GivenSolved with a new evidence term inside. Then, when we use solved
goals to rewrite other constraints we simply use whatever is in the
GivenSolved flavor and not the constraint cc_id.

In our particular case we'd get the following evidence bindings, eventually: 

       g1 = ReflCo tau
       g2 = ReflCo [a]
       g3 = ReflCo [(a,a)]
       g2'= ReflCo [a]
       g3'= ReflCo [(a,a)]

Since we use smart constructors to get rid of g;ReflCo t ~~> g etc.

\begin{code}
1154

1155
1156
1157
1158
1159
1160
1161
1162
1163

warnTcS :: CtLoc orig -> Bool -> SDoc -> TcS ()
warnTcS loc warn_if doc 
  | warn_if   = wrapTcS $ TcM.setCtLoc loc $ TcM.addWarnTc doc
  | otherwise = return ()

getDefaultInfo ::  TcS (SimplContext, [Type], (Bool, Bool))
getDefaultInfo 
  = do { ctxt <- getTcSContext
1164
       ; (tys, flags) <- wrapTcS TcM.tcGetDefaultTys
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
       ; return (ctxt, tys, flags) }

-- Just get some environments needed for instance looking up and matching
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

getInstEnvs :: TcS (InstEnv, InstEnv) 
getInstEnvs = wrapTcS $ Inst.tcGetInstEnvs 

getFamInstEnvs :: TcS (FamInstEnv, FamInstEnv) 
getFamInstEnvs = wrapTcS $ FamInst.tcGetFamInstEnvs

getTopEnv :: TcS HscEnv 
getTopEnv = wrapTcS $ TcM.getTopEnv 

getGblEnv :: TcS TcGblEnv 
getGblEnv = wrapTcS $ TcM.getGblEnv 

-- Various smaller utilities [TODO, maybe will be absorbed in the instance matcher]
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

checkWellStagedDFun :: PredType -> DFunId -> WantedLoc -> TcS () 
checkWellStagedDFun pred dfun_id loc 
  = wrapTcS $ TcM.setCtLoc loc $ 
    do { use_stage <- TcM.getStage
       ; TcM.checkWellStaged pp_thing bind_lvl (thLevel use_stage) }
  where
    pp_thing = ptext (sLit "instance for") <+> quotes (ppr pred)
    bind_lvl = TcM.topIdLvl dfun_id

pprEq :: TcType -> TcType -> SDoc
1195
pprEq ty1 ty2 = pprType $ mkEqPred ty1 ty2
1196
1197

isTouchableMetaTyVar :: TcTyVar -> TcS Bool
1198
isTouchableMetaTyVar tv 
1199
1200
1201
  = do { untch <- getUntouchables
       ; return $ isTouchableMetaTyVar_InRange untch tv } 

1202
1203
isTouchableMetaTyVar_InRange :: TcsUntouchables -> TcTyVar -> Bool 
isTouchableMetaTyVar_InRange (untch,untch_tcs) tv 
1204
1205
  = ASSERT2 ( isTcTyVar tv, ppr tv )
    case tcTyVarDetails tv of 
1206
1207
      MetaTv TcsTv _ -> not (tv `elemVarSet` untch_tcs)
                        -- See Note [Touchable meta type variables] 
1208
1209
1210
1211
      MetaTv {}      -> inTouchableRange untch tv 
      _              -> False 


1212
1213
\end{code}

1214

1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
Note [Touchable meta type variables]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Meta type variables allocated *by the constraint solver itself* are always
touchable.  Example: 
   instance C a b => D [a] where...
if we use this instance declaration we "make up" a fresh meta type
variable for 'b', which we must later guess.  (Perhaps C has a
functional dependency.)  But since we aren't in the constraint *generator*
we can't allocate a Unique in the touchable range for this implication
constraint.  Instead, we mark it as a "TcsTv", which makes it always-touchable.
1225
1226


1227
\begin{code}
1228
1229
1230
1231
1232
-- Flatten skolems
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

newFlattenSkolemTy :: TcType -> TcS TcType
newFlattenSkolemTy ty = mkTyVarTy <$> newFlattenSkolemTyVar ty
1233
1234
1235

newFlattenSkolemTyVar :: TcType -> TcS TcTyVar
newFlattenSkolemTyVar ty
dimitris's avatar
dimitris committed
1236
1237
1238
1239
1240
1241
  = do { tv <- wrapTcS $ 
               do { uniq <- TcM.newUnique
                  ; let name = TcM.mkTcTyVarName uniq (fsLit "f")
                  ; return $ mkTcTyVar name (typeKind ty) (FlatSkol ty) } 
       ; traceTcS "New Flatten Skolem Born" $
         ppr tv <+> text "[:= " <+> ppr ty <+> text "]"
1242
       ; return tv }
1243
1244
1245
1246

-- Instantiations 
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

1247
1248
1249
instDFunType :: DFunId -> [DFunInstType] -> TcS ([TcType], TcType)
instDFunType dfun_id mb_inst_tys 
  = wrapTcS $ go dfun_tvs mb_inst_tys (mkTopTvSubst [])
1250
  where
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
    (dfun_tvs, dfun_phi) = tcSplitForAllTys (idType dfun_id)

    go :: [TyVar] -> [DFunInstType] -> TvSubst -> TcM ([TcType], TcType)
    go [] [] subst = return ([], substTy subst dfun_phi)
    go (tv:tvs) (Just ty : mb_tys) subst
      = do { (tys, phi) <- go tvs mb_tys (extendTvSubst subst tv ty)
           ; return (ty : tys, phi) }
    go (tv:tvs) (Nothing : mb_tys) subst
      = do { ty <- instFlexiTcSHelper (tyVarName tv) (substTy subst (tyVarKind tv))
                         -- Don't forget to instantiate the kind!
                         -- cf TcMType.tcInstTyVarX
           ; (tys, phi) <- go tvs mb_tys (extendTvSubst subst tv ty)
           ; return (ty : tys, phi) }
    go _ _ _ = pprPanic "instDFunTypes" (ppr dfun_id $$ ppr mb_inst_tys)

instFlexiTcS :: TyVar -> TcS TcType 
dimitris's avatar
dimitris committed
1267
1268
-- Like TcM.instMetaTyVar but the variable that is created is 
-- always touchable; we are supposed to guess its instantiation.
1269
-- See Note [Touchable meta type variables] 
1270
instFlexiTcS tv = wrapTcS (instFlexiTcSHelper (tyVarName tv) (tyVarKind tv) )
1271

1272
1273
1274
1275
1276
newFlexiTcSTy :: Kind -> TcS TcType  
newFlexiTcSTy knd 
  = wrapTcS $
    do { uniq <- TcM.newUnique 
       ; ref  <- TcM.newMutVar  Flexi 
1277
       ; let name = TcM.mkTcTyVarName uniq (fsLit "uf")
1278
1279
       ; return $ mkTyVarTy (mkTcTyVar name knd (MetaTv TcsTv ref)) }

1280
1281
1282
1283
1284
1285
isFlexiTcsTv :: TyVar -> Bool
isFlexiTcsTv tv
  | not (isTcTyVar tv)                  = False
  | MetaTv TcsTv _ <- tcTyVarDetails tv = True
  | otherwise                           = False

1286
instFlexiTcSHelper :: Name -> Kind -> TcM TcType
1287
instFlexiTcSHelper tvname tvkind
1288
  = do { uniq <- TcM.newUnique 
1289
1290
1291
       ; ref  <- TcM.newMutVar  Flexi 
       ; let name = setNameUnique tvname uniq 
             kind = tvkind 
1292
       ; return (mkTyVarTy (mkTcTyVar name kind (MetaTv TcsTv ref))) }
1293
1294


dimitris's avatar
dimitris committed
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
-- Creating and setting evidence variables and CtFlavors
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

data XEvTerm = 
  XEvTerm { ev_comp   :: [EvVar] -> EvTerm
                         -- How to compose evidence 
          , ev_decomp :: EvVar -> [EvTerm]
                         -- How to decompose evidence 
          }

data MaybeNew a = Fresh  { mn_thing :: a } 
                | Cached { mn_thing :: a }

isFresh :: MaybeNew a -> Bool
isFresh (Fresh {}) = True
isFresh _ = False

setEvBind :: EvVar -> EvTerm -> TcS ()
setEvBind ev t
  = do { tc_evbinds <- getTcEvBinds
       ; wrapTcS $ TcM.addTcEvBind tc_evbinds ev t

1317
1318
1319
       ; traceTcS "setEvBind" $ vcat [ text "ev =" <+> ppr ev
                                     , text "t  =" <+> ppr t ]

1320
1321
1322
#ifndef DEBUG
       ; return () }
#else
dimitris's avatar
dimitris committed
1323
1324
       ; binds <- getTcEvBindsMap
       ; let cycle = any (reaches binds) (evVarsOfTerm t)
1325
       ; when cycle (fail_if_co_loop binds) }
dimitris's avatar
dimitris committed
1326
1327

  where fail_if_co_loop binds
1328
1329
1330
          = do { traceTcS "Cycle in evidence binds" $ vcat [ text "evvar =" <+> ppr ev
                                                           , ppr (evBindMapBinds binds) ]
               ; when (isEqVar ev) (pprPanic "setEvBind" (text "BUG: Coercion loop!")) }
dimitris's avatar
dimitris committed
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346

        reaches :: EvBindMap -> Var -> Bool 
        -- Does this evvar reach ev? 
        reaches ebm ev0 = go ev0
          where go ev0
                  | ev0 == ev = True
                  | Just (EvBind _ evtrm) <- lookupEvBind ebm ev0
                  = any go (evVarsOfTerm evtrm)
                  | otherwise = False
#endif

newGivenEvVar  :: TcPredType -> EvTerm -> TcS (MaybeNew EvVar)
newGivenEvVar pty evterm
  = do { is <- getTcSInerts
       ; case lookupInInerts is pty of
            Just ct | isGivenOrSolvedCt ct 
1347
                    -> return (Cached (ctId ct))
dimitris's avatar
dimitris committed
1348
1349
1350
1351
1352
1353
1354
1355
1356
            _ -> do { new_ev <- wrapTcS $ TcM.newEvVar pty
                    ; setEvBind new_ev evterm
                    ; return (Fresh new_ev) } }

newWantedEvVar :: TcPredType -> TcS (MaybeNew EvVar)
newWantedEvVar pty
  = do { is <- getTcSInerts
       ; case lookupInInerts is pty of
            Just ct | not (isDerivedCt ct) 
1357
1358
                    -> do { traceTcS "newWantedEvVar/cache hit" $ ppr ct
                          ; return (Cached (ctId ct)) }
dimitris's avatar
dimitris committed
1359
            _ -> do { new_ev <- wrapTcS $ TcM.newEvVar pty
1360
                    ; traceTcS "newWantedEvVar/cache miss" $ ppr new_ev
dimitris's avatar
dimitris committed
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
                    ; return (Fresh new_ev) } }

newDerived :: TcPredType -> TcS (MaybeNew TcPredType)
newDerived pty
  = do { is <- getTcSInerts
       ; case lookupInInerts is pty of
            Just {} -> return (Cached pty)
            _       -> return (Fresh pty) }
    
newKindConstraint :: TcTyVar -> Kind -> TcS (MaybeNew EvVar)
-- Create new wanted CoVar that constrains the type to have the specified kind. 
newKindConstraint tv knd
1373
  = do { ty_k <- wrapTcS (instFlexiTcSHelper (tyVarName tv) knd)
dimitris's avatar
dimitris committed
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
       ; newWantedEvVar (mkTcEqPred (mkTyVarTy tv) ty_k) }

instDFunConstraints :: TcThetaType -> TcS [MaybeNew EvVar]
instDFunConstraints = mapM newWantedEvVar

                
xCtFlavor :: CtFlavor              -- Original flavor   
          -> [TcPredType]          -- New predicate types
          -> XEvTerm               -- Instructions about how to manipulate evidence
          -> ([CtFlavor] -> TcS a) -- What to do with any remaining /fresh/ goals!
          -> TcS a
xCtFlavor = xCtFlavor_cache True          


1388
xCtFlavor_cache :: Bool            -- True = if wanted add to the solved bag!    
dimitris's avatar
dimitris committed
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
          -> CtFlavor              -- Original flavor   
          -> [TcPredType]          -- New predicate types
          -> XEvTerm               -- Instructions about how to manipulate evidence
          -> ([CtFlavor] -> TcS a) -- What to do with any remaining /fresh/ goals!
          -> TcS a
xCtFlavor_cache _ (Given { flav_gloc = gl, flav_evar = evar }) ptys xev cont_with
  = do { let ev_trms = ev_decomp xev evar
       ; new_evars <- zipWithM newGivenEvVar ptys ev_trms
       ; cont_with $
         map (\x -> Given gl (mn_thing x)) (filter isFresh new_evars) }
  
xCtFlavor_cache cache (Wanted { flav_wloc = wl, flav_evar = evar }) ptys xev cont_with
  = do { new_evars <- mapM newWantedEvVar ptys
       ; let evars  = map mn_thing new_evars
             evterm = ev_comp xev evars
       ; setEvBind evar evterm
       ; let solved_flav = Solved { flav_gloc = mkSolvedLoc wl UnkSkol
                                  , flav_evar = evar }
       ; when cache $ addToSolved (mkNonCanonical solved_flav)
       ; cont_with $
         map (\x -> Wanted wl (mn_thing x)) (filter isFresh new_evars) }
    
xCtFlavor_cache _ (Derived { flav_wloc = wl }) ptys _xev cont_with
  = do { ders <- mapM newDerived ptys
       ; cont_with $ 
         map (\x -> Derived wl (mn_thing x)) (filter isFresh ders) }
    
    -- I am not sure I actually want to do this (e.g. from recanonicalizing a solved?)
    -- but if we plan to use xCtFlavor for rewriting as well then I might as well add a case
xCtFlavor_cache _ (Solved { flav_gloc = gl, flav_evar = evar }) ptys xev cont_with
  = do { let ev_trms = ev_decomp xev evar
       ; new_evars <- zipWithM newGivenEvVar ptys ev_trms
       ; cont_with $
         map (\x -> Solved gl (mn_thing x)) (filter isFresh new_evars) }

rewriteCtFlavor :: CtFlavor
                -> TcPredType   -- new predicate
                -> TcCoercion   -- new ~ old     
                -> TcS (Maybe CtFlavor)
Simon Peyton Jones's avatar
Simon Peyton Jones committed
1428
1429
1430
1431
1432
1433
1434
1435
--      rewriteCtFlavor old_fl new_pred co
-- Main purpose: create a new identity (flavor) for new_pred;
--               unless new_pred is cached already
-- * Returns a new_fl : new_pred, with same wanted/given/derived flag as old_fl
-- * If old_fl was wanted, create a binding for old_fl, in terms of new_fl
-- * If old_fl was given, AND not cached, create a binding for new_fl, in terms of old_fl
-- * Returns Nothing if new_fl is already cached

dimitris's avatar
dimitris committed
1436
rewriteCtFlavor = rewriteCtFlavor_cache True
Simon Peyton Jones's avatar
Simon Peyton Jones committed
1437
1438
1439
-- Returns Just new_fl iff either (i)  'co' is reflexivity
--                             or (ii) 'co' is not reflexivity, and 'new_pred' not cached
-- In either case, there is nothing new to do with new_fl
dimitris's avatar
dimitris committed
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456

rewriteCtFlavor_cache :: Bool 
                -> CtFlavor
                -> TcPredType   -- new predicate
                -> TcCoercion   -- new ~ old     
                -> TcS (Maybe CtFlavor)
-- If derived, don't even look at the coercion
-- NB: this allows us to sneak away with ``error'' thunks for 
-- coercions that come from derived ids (which don't exist!) 
rewriteCtFlavor_cache _cache (Derived wl _pty_orig) pty_new _co
  = newDerived pty_new >>= from_mn
  where from_mn (Cached {}) = return Nothing
        from_mn (Fresh {})  = return $ Just (Derived wl pty_new)
        
rewriteCtFlavor_cache cache fl pty co
  | isTcReflCo co
  -- If just reflexivity then you may re-use the same variable as optimization
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
  = if ctFlavPred fl `eqType` pty then 
      -- E.g. for type synonyms we want to use the original type 
      -- since it's not flattened to report better error messages.
      return $ Just fl
    else 
      -- E.g. because we rewrite with a spontaneously solved one
      return (Just $ case fl of
                 Derived wl _pty_orig -> Derived wl pty
                 Given gl ev  -> Given  gl (setVarType ev pty)
                 Wanted wl ev -> Wanted wl (setVarType ev pty)
                 Solved gl ev -> Solved gl (setVarType ev pty))
dimitris's avatar
dimitris committed
1468
1469
  | otherwise 
  = xCtFlavor_cache cache fl [pty] (XEvTerm ev_comp ev_decomp) cont
1470
  where ev_comp [x] = mkEvCast x co
dimitris's avatar
dimitris committed
1471
        ev_comp _   = panic "Coercion can only have one subgoal"
1472
        ev_decomp x = [mkEvCast x (mkTcSymCo co)]
dimitris's avatar
dimitris committed
1473
1474
1475
1476
        cont []     = return Nothing
        cont [fl]   = return $ Just fl
        cont _      = panic "At most one constraint can be subgoal of coercion!"

1477
1478
1479
1480
1481
1482
1483
1484
1485
1486

-- Matching and looking up classes and family instances
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

data MatchInstResult mi
  = MatchInstNo         -- No matching instance 
  | MatchInstSingle mi  -- Single matching instance
  | MatchInstMany       -- Multiple matching instances


1487
matchClass :: Class -> [Type] -> TcS (MatchInstResult (DFunId, [Maybe TcType])) 
1488
1489
1490
1491
-- Look up a class constraint in the instance environment
matchClass clas tys
  = do	{ let pred = mkClassPred clas tys 
        ; instEnvs <- getInstEnvs
1492
--        ; traceTcS "matchClass" $ empty -- text "instEnvs=" <+> ppr instEnvs
1493
        ; case lookupInstEnv instEnvs clas tys of {
1494
            ([], unifs, _)               -- Nothing matches  
1495
1496
1497
1498
1499
                -> do { traceTcS "matchClass not matching"
                                 (vcat [ text "dict" <+> ppr pred, 
                                         text "unifs" <+> ppr unifs ]) 
                      ; return MatchInstNo  
                      } ;  
1500
	    ([(ispec, inst_tys)], [], _) -- A single match 
1501
1502
1503
1504
		-> do	{ let dfun_id = is_dfun ispec
			; traceTcS "matchClass success"
				   (vcat [text "dict" <+> ppr pred, 
				          text "witness" <+> ppr dfun_id
1505
                                           <+> ppr (idType dfun_id) ])
1506
				  -- Record that this dfun is needed
1507
                        ; return $ MatchInstSingle (dfun_id, inst_tys)
1508
                        } ;
1509
     	    (matches, unifs, _)          -- More than one matches 
1510
1511
1512
1513
1514
1515
1516
1517
		-> do	{ traceTcS "matchClass multiple matches, deferring choice"
			           (vcat [text "dict" <+> ppr pred,
				   	  text "matches" <+> ppr matches,
				   	  text "unifs" <+> ppr unifs])
                        ; return MatchInstMany 
		        }
	}
        }
1518

1519
matchFam :: TyCon -> [Type] -> TcS (Maybe (FamInst, [Type]))
1520
matchFam tycon args = wrapTcS $ tcLookupFamInst tycon args
1521
\end{code}
1522

1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
\begin{code}
-- Deferring forall equalities as implications
-- ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

deferTcSForAllEq :: (WantedLoc,EvVar)  -- Original wanted equality flavor
                 -> ([TyVar],TcType)   -- ForAll tvs1 body1
                 -> ([TyVar],TcType)   -- ForAll tvs2 body2
                 -> TcS ()
-- Some of this functionality is repeated from TcUnify, 
-- consider having a single place where we create fresh implications. 
deferTcSForAllEq (loc,orig_ev) (tvs1,body1) (tvs2,body2)
 = do { (subst1, skol_tvs) <- wrapTcS $ TcM.tcInstSkolTyVars tvs1
      ; let tys  = mkTyVarTys skol_tvs
            phi1 = Type.substTy subst1 body1
            phi2 = Type.substTy (zipTopTvSubst tvs2 tys) body2
            skol_info = UnifyForAllSkol skol_tvs phi1
        ; mev <- newWantedEvVar (mkTcEqPred phi1 phi2)
        ; let new_fl = Wanted loc (mn_thing mev)
              new_ct = mkNonCanonical new_fl
              new_co = mkTcCoVarCo (mn_thing mev)
        ; coe_inside <- if isFresh mev then
                           do { ev_binds_var <- wrapTcS $ TcM.newTcEvBinds
                              ; let ev_binds = TcEvBinds ev_binds_var
                              ; lcl_env <- wrapTcS $ TcM.getLclTypeEnv
                              ; loc <- wrapTcS $ TcM.getCtLoc skol_info
                              ; let wc = WC { wc_flat  = singleCt new_ct 
                                            , wc_impl  = emptyBag
                                            , wc_insol = emptyCts }
<