{-
(c) The University of Glasgow 2006
(c) The GRASP/AQUA Project, Glasgow University, 1992-1998


Pattern-matching literal patterns
-}

{-# LANGUAGE CPP, ScopedTypeVariables #-}
{-# LANGUAGE ViewPatterns #-}

module MatchLit ( dsLit, dsOverLit, hsLitKey
                , tidyLitPat, tidyNPat
                , matchLiterals, matchNPlusKPats, matchNPats
                , warnAboutIdentities
                , warnAboutOverflowedOverLit, warnAboutOverflowedLit
                , warnAboutEmptyEnumerations
                ) where

#include "HsVersions.h"

import GhcPrelude

import {-# SOURCE #-} Match  ( match )
import {-# SOURCE #-} DsExpr ( dsExpr, dsSyntaxExpr )

import DsMonad
import DsUtils

import HsSyn

import Id
import CoreSyn
import MkCore
import TyCon
import DataCon
import TcHsSyn ( shortCutLit )
import TcType
import Name
import Type
import PrelNames
import TysWiredIn
import TysPrim
import Literal
import SrcLoc
import Data.Ratio
import Outputable
import BasicTypes
import DynFlags
import Util
import FastString
import qualified GHC.LanguageExtensions as LangExt

import Control.Monad
import Data.Int
import Data.Word
import Data.Proxy

{-
************************************************************************
*                                                                      *
                Desugaring literals
        [used to be in DsExpr, but DsMeta needs it,
         and it's nice to avoid a loop]
*                                                                      *
************************************************************************

We give int/float literals type @Integer@ and @Rational@, respectively.
The typechecker will (presumably) have put \tr{from{Integer,Rational}s}
around them.

ToDo: put in range checks for when converting ``@i@''
(or should that be in the typechecker?)

For numeric literals, we try to detect there use at a standard type
(@Int@, @Float@, etc.) are directly put in the right constructor.
[NB: down with the @App@ conversion.]

See also below where we look for @DictApps@ for \tr{plusInt}, etc.
-}

dsLit :: HsLit GhcRn -> DsM CoreExpr
dsLit :: HsLit GhcRn -> DsM CoreExpr
dsLit l :: HsLit GhcRn
l = do
  DynFlags
dflags <- IOEnv (Env DsGblEnv DsLclEnv) DynFlags
forall (m :: * -> *). HasDynFlags m => m DynFlags
getDynFlags
  case HsLit GhcRn
l of
    HsStringPrim _ s :: ByteString
s -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Literal -> CoreExpr
forall b. Literal -> Expr b
Lit (ByteString -> Literal
LitString ByteString
s))
    HsCharPrim   _ c :: Char
c -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Literal -> CoreExpr
forall b. Literal -> Expr b
Lit (Char -> Literal
LitChar Char
c))
    HsIntPrim    _ i :: Integer
i -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Literal -> CoreExpr
forall b. Literal -> Expr b
Lit (DynFlags -> Integer -> Literal
mkLitIntWrap DynFlags
dflags Integer
i))
    HsWordPrim   _ w :: Integer
w -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Literal -> CoreExpr
forall b. Literal -> Expr b
Lit (DynFlags -> Integer -> Literal
mkLitWordWrap DynFlags
dflags Integer
w))
    HsInt64Prim  _ i :: Integer
i -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Literal -> CoreExpr
forall b. Literal -> Expr b
Lit (DynFlags -> Integer -> Literal
mkLitInt64Wrap DynFlags
dflags Integer
i))
    HsWord64Prim _ w :: Integer
w -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Literal -> CoreExpr
forall b. Literal -> Expr b
Lit (DynFlags -> Integer -> Literal
mkLitWord64Wrap DynFlags
dflags Integer
w))
    HsFloatPrim  _ f :: FractionalLit
f -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Literal -> CoreExpr
forall b. Literal -> Expr b
Lit (Rational -> Literal
LitFloat (FractionalLit -> Rational
fl_value FractionalLit
f)))
    HsDoublePrim _ d :: FractionalLit
d -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Literal -> CoreExpr
forall b. Literal -> Expr b
Lit (Rational -> Literal
LitDouble (FractionalLit -> Rational
fl_value FractionalLit
d)))
    HsChar _ c :: Char
c       -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (Char -> CoreExpr
mkCharExpr Char
c)
    HsString _ str :: FastString
str   -> FastString -> DsM CoreExpr
forall (m :: * -> *). MonadThings m => FastString -> m CoreExpr
mkStringExprFS FastString
str
    HsInteger _ i :: Integer
i _  -> Integer -> DsM CoreExpr
forall (m :: * -> *). MonadThings m => Integer -> m CoreExpr
mkIntegerExpr Integer
i
    HsInt _ i :: IntegralLit
i        -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (DynFlags -> Integer -> CoreExpr
mkIntExpr DynFlags
dflags (IntegralLit -> Integer
il_value IntegralLit
i))
    XLit x :: XXLit GhcRn
x           -> String -> SDoc -> DsM CoreExpr
forall a. HasCallStack => String -> SDoc -> a
pprPanic "dsLit" (NoExt -> SDoc
forall a. Outputable a => a -> SDoc
ppr XXLit GhcRn
NoExt
x)
    HsRat _ (FL _ _ val :: Rational
val) ty :: Type
ty -> do
      CoreExpr
num   <- Integer -> DsM CoreExpr
forall (m :: * -> *). MonadThings m => Integer -> m CoreExpr
mkIntegerExpr (Rational -> Integer
forall a. Ratio a -> a
numerator Rational
val)
      CoreExpr
denom <- Integer -> DsM CoreExpr
forall (m :: * -> *). MonadThings m => Integer -> m CoreExpr
mkIntegerExpr (Rational -> Integer
forall a. Ratio a -> a
denominator Rational
val)
      CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return (DataCon -> [CoreExpr] -> CoreExpr
mkCoreConApps DataCon
ratio_data_con [Type -> CoreExpr
forall b. Type -> Expr b
Type Type
integer_ty, CoreExpr
num, CoreExpr
denom])
      where
        (ratio_data_con :: DataCon
ratio_data_con, integer_ty :: Type
integer_ty)
            = case Type -> (TyCon, [Type])
tcSplitTyConApp Type
ty of
                    (tycon :: TyCon
tycon, [i_ty :: Type
i_ty]) -> ASSERT(isIntegerTy i_ty && tycon `hasKey` ratioTyConKey)
                                       ([DataCon] -> DataCon
forall a. [a] -> a
head (TyCon -> [DataCon]
tyConDataCons TyCon
tycon), Type
i_ty)
                    x :: (TyCon, [Type])
x -> String -> SDoc -> (DataCon, Type)
forall a. HasCallStack => String -> SDoc -> a
pprPanic "dsLit" ((TyCon, [Type]) -> SDoc
forall a. Outputable a => a -> SDoc
ppr (TyCon, [Type])
x)

dsOverLit :: HsOverLit GhcTc -> DsM CoreExpr
-- ^ Post-typechecker, the 'HsExpr' field of an 'OverLit' contains
-- (an expression for) the literal value itself.
dsOverLit :: HsOverLit GhcTc -> DsM CoreExpr
dsOverLit (OverLit { ol_val :: forall p. HsOverLit p -> OverLitVal
ol_val = OverLitVal
val, ol_ext :: forall p. HsOverLit p -> XOverLit p
ol_ext = OverLitTc rebindable ty
                   , ol_witness :: forall p. HsOverLit p -> HsExpr p
ol_witness = HsExpr GhcTc
witness }) = do
  DynFlags
dflags <- IOEnv (Env DsGblEnv DsLclEnv) DynFlags
forall (m :: * -> *). HasDynFlags m => m DynFlags
getDynFlags
  case DynFlags -> OverLitVal -> Type -> Maybe (HsExpr GhcTc)
shortCutLit DynFlags
dflags OverLitVal
val Type
ty of
    Just expr :: HsExpr GhcTc
expr | Bool -> Bool
not Bool
rebindable -> HsExpr GhcTc -> DsM CoreExpr
dsExpr HsExpr GhcTc
expr        -- Note [Literal short cut]
    _                          -> HsExpr GhcTc -> DsM CoreExpr
dsExpr HsExpr GhcTc
witness
dsOverLit XOverLit{} = String -> DsM CoreExpr
forall a. String -> a
panic "dsOverLit"
{-
Note [Literal short cut]
~~~~~~~~~~~~~~~~~~~~~~~~
The type checker tries to do this short-cutting as early as possible, but
because of unification etc, more information is available to the desugarer.
And where it's possible to generate the correct literal right away, it's
much better to do so.


************************************************************************
*                                                                      *
                 Warnings about overflowed literals
*                                                                      *
************************************************************************

Warn about functions like toInteger, fromIntegral, that convert
between one type and another when the to- and from- types are the
same.  Then it's probably (albeit not definitely) the identity
-}

warnAboutIdentities :: DynFlags -> CoreExpr -> Type -> DsM ()
warnAboutIdentities :: DynFlags -> CoreExpr -> Type -> DsM ()
warnAboutIdentities dflags :: DynFlags
dflags (Var conv_fn :: Id
conv_fn) type_of_conv :: Type
type_of_conv
  | WarningFlag -> DynFlags -> Bool
wopt WarningFlag
Opt_WarnIdentities DynFlags
dflags
  , Id -> Name
idName Id
conv_fn Name -> [Name] -> Bool
forall (t :: * -> *) a. (Foldable t, Eq a) => a -> t a -> Bool
`elem` [Name]
conversionNames
  , Just (arg_ty :: Type
arg_ty, res_ty :: Type
res_ty) <- Type -> Maybe (Type, Type)
splitFunTy_maybe Type
type_of_conv
  , Type
arg_ty Type -> Type -> Bool
`eqType` Type
res_ty  -- So we are converting  ty -> ty
  = WarnReason -> SDoc -> DsM ()
warnDs (WarningFlag -> WarnReason
Reason WarningFlag
Opt_WarnIdentities)
           ([SDoc] -> SDoc
vcat [ String -> SDoc
text "Call of" SDoc -> SDoc -> SDoc
<+> Id -> SDoc
forall a. Outputable a => a -> SDoc
ppr Id
conv_fn SDoc -> SDoc -> SDoc
<+> SDoc
dcolon SDoc -> SDoc -> SDoc
<+> Type -> SDoc
forall a. Outputable a => a -> SDoc
ppr Type
type_of_conv
                 , Int -> SDoc -> SDoc
nest 2 (SDoc -> SDoc) -> SDoc -> SDoc
forall a b. (a -> b) -> a -> b
$ String -> SDoc
text "can probably be omitted"
           ])
warnAboutIdentities _ _ _ = () -> DsM ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()

conversionNames :: [Name]
conversionNames :: [Name]
conversionNames
  = [ Name
toIntegerName, Name
toRationalName
    , Name
fromIntegralName, Name
realToFracName ]
 -- We can't easily add fromIntegerName, fromRationalName,
 -- because they are generated by literals


-- | Emit warnings on overloaded integral literals which overflow the bounds
-- implied by their type.
warnAboutOverflowedOverLit :: HsOverLit GhcTc -> DsM ()
warnAboutOverflowedOverLit :: HsOverLit GhcTc -> DsM ()
warnAboutOverflowedOverLit hsOverLit :: HsOverLit GhcTc
hsOverLit = do
  DynFlags
dflags <- IOEnv (Env DsGblEnv DsLclEnv) DynFlags
forall (m :: * -> *). HasDynFlags m => m DynFlags
getDynFlags
  DynFlags -> Maybe (Integer, Name) -> DsM ()
warnAboutOverflowedLiterals DynFlags
dflags (HsOverLit GhcTc -> Maybe (Integer, Name)
getIntegralLit HsOverLit GhcTc
hsOverLit)

-- | Emit warnings on integral literals which overflow the boudns implied by
-- their type.
warnAboutOverflowedLit :: HsLit GhcTc -> DsM ()
warnAboutOverflowedLit :: HsLit GhcTc -> DsM ()
warnAboutOverflowedLit hsLit :: HsLit GhcTc
hsLit = do
  DynFlags
dflags <- IOEnv (Env DsGblEnv DsLclEnv) DynFlags
forall (m :: * -> *). HasDynFlags m => m DynFlags
getDynFlags
  DynFlags -> Maybe (Integer, Name) -> DsM ()
warnAboutOverflowedLiterals DynFlags
dflags (HsLit GhcTc -> Maybe (Integer, Name)
getSimpleIntegralLit HsLit GhcTc
hsLit)

-- | Emit warnings on integral literals which overflow the bounds implied by
-- their type.
warnAboutOverflowedLiterals
  :: DynFlags
  -> Maybe (Integer, Name)  -- ^ the literal value and name of its tycon
  -> DsM ()
warnAboutOverflowedLiterals :: DynFlags -> Maybe (Integer, Name) -> DsM ()
warnAboutOverflowedLiterals dflags :: DynFlags
dflags lit :: Maybe (Integer, Name)
lit
 | WarningFlag -> DynFlags -> Bool
wopt WarningFlag
Opt_WarnOverflowedLiterals DynFlags
dflags
 , Just (i :: Integer
i, tc :: Name
tc) <- Maybe (Integer, Name)
lit
 =  if      Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
intTyConName     then Integer -> Name -> Proxy Int -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int
forall k (t :: k). Proxy t
Proxy :: Proxy Int)

    -- These only show up via the 'HsOverLit' route
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int8TyConName    then Integer -> Name -> Proxy Int8 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int8
forall k (t :: k). Proxy t
Proxy :: Proxy Int8)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int16TyConName   then Integer -> Name -> Proxy Int16 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int16
forall k (t :: k). Proxy t
Proxy :: Proxy Int16)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int32TyConName   then Integer -> Name -> Proxy Int32 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int32
forall k (t :: k). Proxy t
Proxy :: Proxy Int32)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int64TyConName   then Integer -> Name -> Proxy Int64 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int64
forall k (t :: k). Proxy t
Proxy :: Proxy Int64)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
wordTyConName    then Integer -> Name -> Proxy Word -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word
forall k (t :: k). Proxy t
Proxy :: Proxy Word)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word8TyConName   then Integer -> Name -> Proxy Word8 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word8
forall k (t :: k). Proxy t
Proxy :: Proxy Word8)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word16TyConName  then Integer -> Name -> Proxy Word16 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word16
forall k (t :: k). Proxy t
Proxy :: Proxy Word16)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word32TyConName  then Integer -> Name -> Proxy Word32 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word32
forall k (t :: k). Proxy t
Proxy :: Proxy Word32)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word64TyConName  then Integer -> Name -> Proxy Word64 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word64
forall k (t :: k). Proxy t
Proxy :: Proxy Word64)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
naturalTyConName then Integer -> Name -> DsM ()
checkPositive Integer
i Name
tc

    -- These only show up via the 'HsLit' route
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
intPrimTyConName    then Integer -> Name -> Proxy Int -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int
forall k (t :: k). Proxy t
Proxy :: Proxy Int)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int8PrimTyConName   then Integer -> Name -> Proxy Int8 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int8
forall k (t :: k). Proxy t
Proxy :: Proxy Int8)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int32PrimTyConName  then Integer -> Name -> Proxy Int32 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int32
forall k (t :: k). Proxy t
Proxy :: Proxy Int32)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int64PrimTyConName  then Integer -> Name -> Proxy Int64 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Int64
forall k (t :: k). Proxy t
Proxy :: Proxy Int64)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
wordPrimTyConName   then Integer -> Name -> Proxy Word -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word
forall k (t :: k). Proxy t
Proxy :: Proxy Word)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word8PrimTyConName  then Integer -> Name -> Proxy Word8 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word8
forall k (t :: k). Proxy t
Proxy :: Proxy Word8)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word32PrimTyConName then Integer -> Name -> Proxy Word32 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word32
forall k (t :: k). Proxy t
Proxy :: Proxy Word32)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word64PrimTyConName then Integer -> Name -> Proxy Word64 -> DsM ()
forall a.
(Bounded a, Integral a) =>
Integer -> Name -> Proxy a -> DsM ()
check Integer
i Name
tc (Proxy Word64
forall k (t :: k). Proxy t
Proxy :: Proxy Word64)

    else () -> DsM ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()

  | Bool
otherwise = () -> DsM ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()
  where

    checkPositive :: Integer -> Name -> DsM ()
    checkPositive :: Integer -> Name -> DsM ()
checkPositive i :: Integer
i tc :: Name
tc
      = Bool -> DsM () -> DsM ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when (Integer
i Integer -> Integer -> Bool
forall a. Ord a => a -> a -> Bool
< 0) (DsM () -> DsM ()) -> DsM () -> DsM ()
forall a b. (a -> b) -> a -> b
$ do
        WarnReason -> SDoc -> DsM ()
warnDs (WarningFlag -> WarnReason
Reason WarningFlag
Opt_WarnOverflowedLiterals)
               ([SDoc] -> SDoc
vcat [ String -> SDoc
text "Literal" SDoc -> SDoc -> SDoc
<+> Integer -> SDoc
integer Integer
i
                       SDoc -> SDoc -> SDoc
<+> String -> SDoc
text "is negative but" SDoc -> SDoc -> SDoc
<+> Name -> SDoc
forall a. Outputable a => a -> SDoc
ppr Name
tc
                       SDoc -> SDoc -> SDoc
<+> PtrString -> SDoc
ptext (String -> PtrString
sLit "only supports positive numbers")
                     ])

    check :: forall a. (Bounded a, Integral a) => Integer -> Name -> Proxy a -> DsM ()
    check :: Integer -> Name -> Proxy a -> DsM ()
check i :: Integer
i tc :: Name
tc _proxy :: Proxy a
_proxy
      = Bool -> DsM () -> DsM ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when (Integer
i Integer -> Integer -> Bool
forall a. Ord a => a -> a -> Bool
< Integer
minB Bool -> Bool -> Bool
|| Integer
i Integer -> Integer -> Bool
forall a. Ord a => a -> a -> Bool
> Integer
maxB) (DsM () -> DsM ()) -> DsM () -> DsM ()
forall a b. (a -> b) -> a -> b
$ do
        WarnReason -> SDoc -> DsM ()
warnDs (WarningFlag -> WarnReason
Reason WarningFlag
Opt_WarnOverflowedLiterals)
               ([SDoc] -> SDoc
vcat [ String -> SDoc
text "Literal" SDoc -> SDoc -> SDoc
<+> Integer -> SDoc
integer Integer
i
                       SDoc -> SDoc -> SDoc
<+> String -> SDoc
text "is out of the" SDoc -> SDoc -> SDoc
<+> Name -> SDoc
forall a. Outputable a => a -> SDoc
ppr Name
tc SDoc -> SDoc -> SDoc
<+> PtrString -> SDoc
ptext (String -> PtrString
sLit "range")
                       SDoc -> SDoc -> SDoc
<+> Integer -> SDoc
integer Integer
minB SDoc -> SDoc -> SDoc
<> String -> SDoc
text ".." SDoc -> SDoc -> SDoc
<> Integer -> SDoc
integer Integer
maxB
                     , SDoc
sug ])
      where
        minB :: Integer
minB = a -> Integer
forall a. Integral a => a -> Integer
toInteger (a
forall a. Bounded a => a
minBound :: a)
        maxB :: Integer
maxB = a -> Integer
forall a. Integral a => a -> Integer
toInteger (a
forall a. Bounded a => a
maxBound :: a)
        sug :: SDoc
sug | Integer
minB Integer -> Integer -> Bool
forall a. Eq a => a -> a -> Bool
== -Integer
i   -- Note [Suggest NegativeLiterals]
            , Integer
i Integer -> Integer -> Bool
forall a. Ord a => a -> a -> Bool
> 0
            , Bool -> Bool
not (Extension -> DynFlags -> Bool
xopt Extension
LangExt.NegativeLiterals DynFlags
dflags)
            = String -> SDoc
text "If you are trying to write a large negative literal, use NegativeLiterals"
            | Bool
otherwise = SDoc
Outputable.empty

{-
Note [Suggest NegativeLiterals]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
If you write
  x :: Int8
  x = -128
it'll parse as (negate 128), and overflow.  In this case, suggest NegativeLiterals.
We get an erroneous suggestion for
  x = 128
but perhaps that does not matter too much.
-}

warnAboutEmptyEnumerations :: DynFlags -> LHsExpr GhcTc -> Maybe (LHsExpr GhcTc)
                           -> LHsExpr GhcTc -> DsM ()
-- ^ Warns about @[2,3 .. 1]@ which returns the empty list.
-- Only works for integral types, not floating point.
warnAboutEmptyEnumerations :: DynFlags
-> LHsExpr GhcTc
-> Maybe (LHsExpr GhcTc)
-> LHsExpr GhcTc
-> DsM ()
warnAboutEmptyEnumerations dflags :: DynFlags
dflags fromExpr :: LHsExpr GhcTc
fromExpr mThnExpr :: Maybe (LHsExpr GhcTc)
mThnExpr toExpr :: LHsExpr GhcTc
toExpr
  | WarningFlag -> DynFlags -> Bool
wopt WarningFlag
Opt_WarnEmptyEnumerations DynFlags
dflags
  , Just (from :: Integer
from,tc :: Name
tc) <- LHsExpr GhcTc -> Maybe (Integer, Name)
getLHsIntegralLit LHsExpr GhcTc
fromExpr
  , Just mThn :: Maybe (Integer, Name)
mThn      <- (LHsExpr GhcTc -> Maybe (Integer, Name))
-> Maybe (LHsExpr GhcTc) -> Maybe (Maybe (Integer, Name))
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
traverse LHsExpr GhcTc -> Maybe (Integer, Name)
getLHsIntegralLit Maybe (LHsExpr GhcTc)
mThnExpr
  , Just (to :: Integer
to,_)    <- LHsExpr GhcTc -> Maybe (Integer, Name)
getLHsIntegralLit LHsExpr GhcTc
toExpr
  , let check :: forall a. (Enum a, Num a) => Proxy a -> DsM ()
        check :: Proxy a -> DsM ()
check _proxy :: Proxy a
_proxy
          = Bool -> DsM () -> DsM ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when ([a] -> Bool
forall (t :: * -> *) a. Foldable t => t a -> Bool
null [a]
enumeration) (DsM () -> DsM ()) -> DsM () -> DsM ()
forall a b. (a -> b) -> a -> b
$
            WarnReason -> SDoc -> DsM ()
warnDs (WarningFlag -> WarnReason
Reason WarningFlag
Opt_WarnEmptyEnumerations) (String -> SDoc
text "Enumeration is empty")
          where
            enumeration :: [a]
            enumeration :: [a]
enumeration = case Maybe (Integer, Name)
mThn of
                            Nothing      -> [Integer -> a
forall a. Num a => Integer -> a
fromInteger Integer
from                    .. Integer -> a
forall a. Num a => Integer -> a
fromInteger Integer
to]
                            Just (thn :: Integer
thn,_) -> [Integer -> a
forall a. Num a => Integer -> a
fromInteger Integer
from, Integer -> a
forall a. Num a => Integer -> a
fromInteger Integer
thn   .. Integer -> a
forall a. Num a => Integer -> a
fromInteger Integer
to]

  = if      Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
intTyConName    then Proxy Int -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Int
forall k (t :: k). Proxy t
Proxy :: Proxy Int)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int8TyConName   then Proxy Int8 -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Int8
forall k (t :: k). Proxy t
Proxy :: Proxy Int8)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int16TyConName  then Proxy Int16 -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Int16
forall k (t :: k). Proxy t
Proxy :: Proxy Int16)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int32TyConName  then Proxy Int32 -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Int32
forall k (t :: k). Proxy t
Proxy :: Proxy Int32)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
int64TyConName  then Proxy Int64 -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Int64
forall k (t :: k). Proxy t
Proxy :: Proxy Int64)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
wordTyConName   then Proxy Word -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Word
forall k (t :: k). Proxy t
Proxy :: Proxy Word)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word8TyConName  then Proxy Word8 -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Word8
forall k (t :: k). Proxy t
Proxy :: Proxy Word8)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word16TyConName then Proxy Word16 -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Word16
forall k (t :: k). Proxy t
Proxy :: Proxy Word16)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word32TyConName then Proxy Word32 -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Word32
forall k (t :: k). Proxy t
Proxy :: Proxy Word32)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
word64TyConName then Proxy Word64 -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Word64
forall k (t :: k). Proxy t
Proxy :: Proxy Word64)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
integerTyConName then Proxy Integer -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Integer
forall k (t :: k). Proxy t
Proxy :: Proxy Integer)
    else if Name
tc Name -> Name -> Bool
forall a. Eq a => a -> a -> Bool
== Name
naturalTyConName then Proxy Integer -> DsM ()
forall a. (Enum a, Num a) => Proxy a -> DsM ()
check (Proxy Integer
forall k (t :: k). Proxy t
Proxy :: Proxy Integer)
      -- We use 'Integer' because otherwise a negative 'Natural' literal
      -- could cause a compile time crash (instead of a runtime one).
      -- See the T10930b test case for an example of where this matters.
    else () -> DsM ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()

  | Bool
otherwise = () -> DsM ()
forall (m :: * -> *) a. Monad m => a -> m a
return ()

getLHsIntegralLit :: LHsExpr GhcTc -> Maybe (Integer, Name)
-- ^ See if the expression is an 'Integral' literal.
-- Remember to look through automatically-added tick-boxes! (Trac #8384)
getLHsIntegralLit :: LHsExpr GhcTc -> Maybe (Integer, Name)
getLHsIntegralLit (LHsExpr GhcTc -> Located (SrcSpanLess (LHsExpr GhcTc))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ (HsPar _ e))            = LHsExpr GhcTc -> Maybe (Integer, Name)
getLHsIntegralLit LHsExpr GhcTc
e
getLHsIntegralLit (LHsExpr GhcTc -> Located (SrcSpanLess (LHsExpr GhcTc))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ (HsTick _ _ e))         = LHsExpr GhcTc -> Maybe (Integer, Name)
getLHsIntegralLit LHsExpr GhcTc
e
getLHsIntegralLit (LHsExpr GhcTc -> Located (SrcSpanLess (LHsExpr GhcTc))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ (HsBinTick _ _ _ e))    = LHsExpr GhcTc -> Maybe (Integer, Name)
getLHsIntegralLit LHsExpr GhcTc
e
getLHsIntegralLit (LHsExpr GhcTc -> Located (SrcSpanLess (LHsExpr GhcTc))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ (HsOverLit _ over_lit)) = HsOverLit GhcTc -> Maybe (Integer, Name)
getIntegralLit HsOverLit GhcTc
over_lit
getLHsIntegralLit (LHsExpr GhcTc -> Located (SrcSpanLess (LHsExpr GhcTc))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ (HsLit _ lit))          = HsLit GhcTc -> Maybe (Integer, Name)
getSimpleIntegralLit HsLit GhcTc
lit
getLHsIntegralLit _ = Maybe (Integer, Name)
forall a. Maybe a
Nothing

-- | If 'Integral', extract the value and type name of the overloaded literal.
getIntegralLit :: HsOverLit GhcTc -> Maybe (Integer, Name)
getIntegralLit :: HsOverLit GhcTc -> Maybe (Integer, Name)
getIntegralLit (OverLit { ol_val :: forall p. HsOverLit p -> OverLitVal
ol_val = HsIntegral i :: IntegralLit
i, ol_ext :: forall p. HsOverLit p -> XOverLit p
ol_ext = OverLitTc _ ty })
  | Just tc :: TyCon
tc <- Type -> Maybe TyCon
tyConAppTyCon_maybe Type
ty
  = (Integer, Name) -> Maybe (Integer, Name)
forall a. a -> Maybe a
Just (IntegralLit -> Integer
il_value IntegralLit
i, TyCon -> Name
tyConName TyCon
tc)
getIntegralLit _ = Maybe (Integer, Name)
forall a. Maybe a
Nothing

-- | If 'Integral', extract the value and type name of the non-overloaded
-- literal.
getSimpleIntegralLit :: HsLit GhcTc -> Maybe (Integer, Name)
getSimpleIntegralLit :: HsLit GhcTc -> Maybe (Integer, Name)
getSimpleIntegralLit (HsInt _ IL{ il_value :: IntegralLit -> Integer
il_value = Integer
i }) = (Integer, Name) -> Maybe (Integer, Name)
forall a. a -> Maybe a
Just (Integer
i, Name
intTyConName)
getSimpleIntegralLit (HsIntPrim _ i :: Integer
i) = (Integer, Name) -> Maybe (Integer, Name)
forall a. a -> Maybe a
Just (Integer
i, Name
intPrimTyConName)
getSimpleIntegralLit (HsWordPrim _ i :: Integer
i) = (Integer, Name) -> Maybe (Integer, Name)
forall a. a -> Maybe a
Just (Integer
i, Name
wordPrimTyConName)
getSimpleIntegralLit (HsInt64Prim _ i :: Integer
i) = (Integer, Name) -> Maybe (Integer, Name)
forall a. a -> Maybe a
Just (Integer
i, Name
int64PrimTyConName)
getSimpleIntegralLit (HsWord64Prim _ i :: Integer
i) = (Integer, Name) -> Maybe (Integer, Name)
forall a. a -> Maybe a
Just (Integer
i, Name
word64PrimTyConName)
getSimpleIntegralLit (HsInteger _ i :: Integer
i ty :: Type
ty)
  | Just tc :: TyCon
tc <- Type -> Maybe TyCon
tyConAppTyCon_maybe Type
ty
  = (Integer, Name) -> Maybe (Integer, Name)
forall a. a -> Maybe a
Just (Integer
i, TyCon -> Name
tyConName TyCon
tc)
getSimpleIntegralLit _ = Maybe (Integer, Name)
forall a. Maybe a
Nothing

{-
************************************************************************
*                                                                      *
        Tidying lit pats
*                                                                      *
************************************************************************
-}

tidyLitPat :: HsLit GhcTc -> Pat GhcTc
-- Result has only the following HsLits:
--      HsIntPrim, HsWordPrim, HsCharPrim, HsFloatPrim
--      HsDoublePrim, HsStringPrim, HsString
--  * HsInteger, HsRat, HsInt can't show up in LitPats
--  * We get rid of HsChar right here
tidyLitPat :: HsLit GhcTc -> Pat GhcTc
tidyLitPat (HsChar src :: XHsChar GhcTc
src c :: Char
c) = Pat GhcTc -> SrcSpanLess (Pat GhcTc)
forall a. HasSrcSpan a => a -> SrcSpanLess a
unLoc (SourceText -> Char -> Pat GhcTc
forall (p :: Pass). SourceText -> Char -> OutPat (GhcPass p)
mkCharLitPat SourceText
XHsChar GhcTc
src Char
c)
tidyLitPat (HsString src :: XHsString GhcTc
src s :: FastString
s)
  | FastString -> Int
lengthFS FastString
s Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= 1     -- Short string literals only
  = Pat GhcTc -> Pat GhcTc
forall a. HasSrcSpan a => a -> SrcSpanLess a
unLoc (Pat GhcTc -> Pat GhcTc) -> Pat GhcTc -> Pat GhcTc
forall a b. (a -> b) -> a -> b
$ (Char -> Pat GhcTc -> Pat GhcTc)
-> Pat GhcTc -> String -> Pat GhcTc
forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr (\c :: Char
c pat :: Pat GhcTc
pat -> DataCon -> [Pat GhcTc] -> [Type] -> Pat GhcTc
forall (p :: Pass).
DataCon -> [OutPat (GhcPass p)] -> [Type] -> OutPat (GhcPass p)
mkPrefixConPat DataCon
consDataCon
                                             [SourceText -> Char -> Pat GhcTc
forall (p :: Pass). SourceText -> Char -> OutPat (GhcPass p)
mkCharLitPat SourceText
XHsString GhcTc
src Char
c, Pat GhcTc
pat] [Type
charTy])
                  (Type -> Pat GhcTc
forall (p :: Pass). Type -> OutPat (GhcPass p)
mkNilPat Type
charTy) (FastString -> String
unpackFS FastString
s)
        -- The stringTy is the type of the whole pattern, not
        -- the type to instantiate (:) or [] with!
tidyLitPat lit :: HsLit GhcTc
lit = XLitPat GhcTc -> HsLit GhcTc -> Pat GhcTc
forall p. XLitPat p -> HsLit p -> Pat p
LitPat XLitPat GhcTc
NoExt
noExt HsLit GhcTc
lit

----------------
tidyNPat :: HsOverLit GhcTc -> Maybe (SyntaxExpr GhcTc) -> SyntaxExpr GhcTc
         -> Type
         -> Pat GhcTc
tidyNPat :: HsOverLit GhcTc
-> Maybe (SyntaxExpr GhcTc)
-> SyntaxExpr GhcTc
-> Type
-> Pat GhcTc
tidyNPat (OverLit (OverLitTc False ty) val :: OverLitVal
val _) mb_neg :: Maybe (SyntaxExpr GhcTc)
mb_neg _eq :: SyntaxExpr GhcTc
_eq outer_ty :: Type
outer_ty
        -- False: Take short cuts only if the literal is not using rebindable syntax
        --
        -- Once that is settled, look for cases where the type of the
        -- entire overloaded literal matches the type of the underlying literal,
        -- and in that case take the short cut
        -- NB: Watch out for weird cases like Trac #3382
        --        f :: Int -> Int
        --        f "blah" = 4
        --     which might be ok if we have 'instance IsString Int'
        --
  | Bool -> Bool
not Bool
type_change, Type -> Bool
isIntTy Type
ty,    Just int_lit :: Integer
int_lit <- Maybe Integer
mb_int_lit
                 = DataCon -> HsLit GhcTc -> Pat GhcTc
mk_con_pat DataCon
intDataCon    (XHsIntPrim GhcTc -> Integer -> HsLit GhcTc
forall x. XHsIntPrim x -> Integer -> HsLit x
HsIntPrim    SourceText
XHsIntPrim GhcTc
NoSourceText Integer
int_lit)
  | Bool -> Bool
not Bool
type_change, Type -> Bool
isWordTy Type
ty,   Just int_lit :: Integer
int_lit <- Maybe Integer
mb_int_lit
                 = DataCon -> HsLit GhcTc -> Pat GhcTc
mk_con_pat DataCon
wordDataCon   (XHsWordPrim GhcTc -> Integer -> HsLit GhcTc
forall x. XHsWordPrim x -> Integer -> HsLit x
HsWordPrim   SourceText
XHsWordPrim GhcTc
NoSourceText Integer
int_lit)
  | Bool -> Bool
not Bool
type_change, Type -> Bool
isStringTy Type
ty, Just str_lit :: FastString
str_lit <- Maybe FastString
mb_str_lit
                 = HsLit GhcTc -> Pat GhcTc
tidyLitPat (XHsString GhcTc -> FastString -> HsLit GhcTc
forall x. XHsString x -> FastString -> HsLit x
HsString SourceText
XHsString GhcTc
NoSourceText FastString
str_lit)
     -- NB: do /not/ convert Float or Double literals to F# 3.8 or D# 5.3
     -- If we do convert to the constructor form, we'll generate a case
     -- expression on a Float# or Double# and that's not allowed in Core; see
     -- Trac #9238 and Note [Rules for floating-point comparisons] in PrelRules
  where
    -- Sometimes (like in test case
    -- overloadedlists/should_run/overloadedlistsrun04), the SyntaxExprs include
    -- type-changing wrappers (for example, from Id Int to Int, for the identity
    -- type family Id). In these cases, we can't do the short-cut.
    type_change :: Bool
type_change = Bool -> Bool
not (Type
outer_ty Type -> Type -> Bool
`eqType` Type
ty)

    mk_con_pat :: DataCon -> HsLit GhcTc -> Pat GhcTc
    mk_con_pat :: DataCon -> HsLit GhcTc -> Pat GhcTc
mk_con_pat con :: DataCon
con lit :: HsLit GhcTc
lit
      = Pat GhcTc -> SrcSpanLess (Pat GhcTc)
forall a. HasSrcSpan a => a -> SrcSpanLess a
unLoc (DataCon -> [Pat GhcTc] -> [Type] -> Pat GhcTc
forall (p :: Pass).
DataCon -> [OutPat (GhcPass p)] -> [Type] -> OutPat (GhcPass p)
mkPrefixConPat DataCon
con [SrcSpanLess (Pat GhcTc) -> Pat GhcTc
forall a. HasSrcSpan a => SrcSpanLess a -> a
noLoc (SrcSpanLess (Pat GhcTc) -> Pat GhcTc)
-> SrcSpanLess (Pat GhcTc) -> Pat GhcTc
forall a b. (a -> b) -> a -> b
$ XLitPat GhcTc -> HsLit GhcTc -> Pat GhcTc
forall p. XLitPat p -> HsLit p -> Pat p
LitPat XLitPat GhcTc
NoExt
noExt HsLit GhcTc
lit] [])

    mb_int_lit :: Maybe Integer
    mb_int_lit :: Maybe Integer
mb_int_lit = case (Maybe (SyntaxExpr GhcTc)
mb_neg, OverLitVal
val) of
                   (Nothing, HsIntegral i :: IntegralLit
i) -> Integer -> Maybe Integer
forall a. a -> Maybe a
Just (IntegralLit -> Integer
il_value IntegralLit
i)
                   (Just _,  HsIntegral i :: IntegralLit
i) -> Integer -> Maybe Integer
forall a. a -> Maybe a
Just (-(IntegralLit -> Integer
il_value IntegralLit
i))
                   _ -> Maybe Integer
forall a. Maybe a
Nothing

    mb_str_lit :: Maybe FastString
    mb_str_lit :: Maybe FastString
mb_str_lit = case (Maybe (SyntaxExpr GhcTc)
mb_neg, OverLitVal
val) of
                   (Nothing, HsIsString _ s :: FastString
s) -> FastString -> Maybe FastString
forall a. a -> Maybe a
Just FastString
s
                   _ -> Maybe FastString
forall a. Maybe a
Nothing

tidyNPat over_lit :: HsOverLit GhcTc
over_lit mb_neg :: Maybe (SyntaxExpr GhcTc)
mb_neg eq :: SyntaxExpr GhcTc
eq outer_ty :: Type
outer_ty
  = XNPat GhcTc
-> Located (HsOverLit GhcTc)
-> Maybe (SyntaxExpr GhcTc)
-> SyntaxExpr GhcTc
-> Pat GhcTc
forall p.
XNPat p
-> Located (HsOverLit p)
-> Maybe (SyntaxExpr p)
-> SyntaxExpr p
-> Pat p
NPat Type
XNPat GhcTc
outer_ty (SrcSpanLess (Located (HsOverLit GhcTc))
-> Located (HsOverLit GhcTc)
forall a. HasSrcSpan a => SrcSpanLess a -> a
noLoc SrcSpanLess (Located (HsOverLit GhcTc))
HsOverLit GhcTc
over_lit) Maybe (SyntaxExpr GhcTc)
mb_neg SyntaxExpr GhcTc
eq

{-
************************************************************************
*                                                                      *
                Pattern matching on LitPat
*                                                                      *
************************************************************************
-}

matchLiterals :: [Id]
              -> Type                   -- Type of the whole case expression
              -> [[EquationInfo]]       -- All PgLits
              -> DsM MatchResult

matchLiterals :: [Id] -> Type -> [[EquationInfo]] -> DsM MatchResult
matchLiterals (var :: Id
var:vars :: [Id]
vars) ty :: Type
ty sub_groups :: [[EquationInfo]]
sub_groups
  = ASSERT( notNull sub_groups && all notNull sub_groups )
    do  {       -- Deal with each group
        ; [(Literal, MatchResult)]
alts <- ([EquationInfo]
 -> IOEnv (Env DsGblEnv DsLclEnv) (Literal, MatchResult))
-> [[EquationInfo]]
-> IOEnv (Env DsGblEnv DsLclEnv) [(Literal, MatchResult)]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM [EquationInfo]
-> IOEnv (Env DsGblEnv DsLclEnv) (Literal, MatchResult)
match_group [[EquationInfo]]
sub_groups

                -- Combine results.  For everything except String
                -- we can use a case expression; for String we need
                -- a chain of if-then-else
        ; if Type -> Bool
isStringTy (Id -> Type
idType Id
var) then
            do  { Id
eq_str <- Name -> DsM Id
dsLookupGlobalId Name
eqStringName
                ; [MatchResult]
mrs <- ((Literal, MatchResult) -> DsM MatchResult)
-> [(Literal, MatchResult)]
-> IOEnv (Env DsGblEnv DsLclEnv) [MatchResult]
forall (t :: * -> *) (m :: * -> *) a b.
(Traversable t, Monad m) =>
(a -> m b) -> t a -> m (t b)
mapM (Id -> (Literal, MatchResult) -> DsM MatchResult
wrap_str_guard Id
eq_str) [(Literal, MatchResult)]
alts
                ; MatchResult -> DsM MatchResult
forall (m :: * -> *) a. Monad m => a -> m a
return ((MatchResult -> MatchResult -> MatchResult)
-> [MatchResult] -> MatchResult
forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldr1 MatchResult -> MatchResult -> MatchResult
combineMatchResults [MatchResult]
mrs) }
          else
            MatchResult -> DsM MatchResult
forall (m :: * -> *) a. Monad m => a -> m a
return (Id -> Type -> [(Literal, MatchResult)] -> MatchResult
mkCoPrimCaseMatchResult Id
var Type
ty [(Literal, MatchResult)]
alts)
        }
  where
    match_group :: [EquationInfo] -> DsM (Literal, MatchResult)
    match_group :: [EquationInfo]
-> IOEnv (Env DsGblEnv DsLclEnv) (Literal, MatchResult)
match_group eqns :: [EquationInfo]
eqns
        = do { DynFlags
dflags <- IOEnv (Env DsGblEnv DsLclEnv) DynFlags
forall (m :: * -> *). HasDynFlags m => m DynFlags
getDynFlags
             ; let LitPat _ hs_lit :: HsLit GhcTc
hs_lit = EquationInfo -> Pat GhcTc
firstPat ([EquationInfo] -> EquationInfo
forall a. [a] -> a
head [EquationInfo]
eqns)
             ; MatchResult
match_result <- [Id] -> Type -> [EquationInfo] -> DsM MatchResult
match [Id]
vars Type
ty ([EquationInfo] -> [EquationInfo]
shiftEqns [EquationInfo]
eqns)
             ; (Literal, MatchResult)
-> IOEnv (Env DsGblEnv DsLclEnv) (Literal, MatchResult)
forall (m :: * -> *) a. Monad m => a -> m a
return (DynFlags -> HsLit GhcTc -> Literal
hsLitKey DynFlags
dflags HsLit GhcTc
hs_lit, MatchResult
match_result) }

    wrap_str_guard :: Id -> (Literal,MatchResult) -> DsM MatchResult
        -- Equality check for string literals
    wrap_str_guard :: Id -> (Literal, MatchResult) -> DsM MatchResult
wrap_str_guard eq_str :: Id
eq_str (LitString s :: ByteString
s, mr :: MatchResult
mr)
        = do { -- We now have to convert back to FastString. Perhaps there
               -- should be separate LitBytes and LitString constructors?
               let s' :: FastString
s'  = ByteString -> FastString
mkFastStringByteString ByteString
s
             ; CoreExpr
lit    <- FastString -> DsM CoreExpr
forall (m :: * -> *). MonadThings m => FastString -> m CoreExpr
mkStringExprFS FastString
s'
             ; let pred :: CoreExpr
pred = CoreExpr -> [CoreExpr] -> CoreExpr
forall b. Expr b -> [Expr b] -> Expr b
mkApps (Id -> CoreExpr
forall b. Id -> Expr b
Var Id
eq_str) [Id -> CoreExpr
forall b. Id -> Expr b
Var Id
var, CoreExpr
lit]
             ; MatchResult -> DsM MatchResult
forall (m :: * -> *) a. Monad m => a -> m a
return (CoreExpr -> MatchResult -> MatchResult
mkGuardedMatchResult CoreExpr
pred MatchResult
mr) }
    wrap_str_guard _ (l :: Literal
l, _) = String -> SDoc -> DsM MatchResult
forall a. HasCallStack => String -> SDoc -> a
pprPanic "matchLiterals/wrap_str_guard" (Literal -> SDoc
forall a. Outputable a => a -> SDoc
ppr Literal
l)

matchLiterals [] _ _ = String -> DsM MatchResult
forall a. String -> a
panic "matchLiterals []"

---------------------------
hsLitKey :: DynFlags -> HsLit GhcTc -> Literal
-- Get the Core literal corresponding to a HsLit.
-- It only works for primitive types and strings;
-- others have been removed by tidy
-- For HsString, it produces a LitString, which really represents an _unboxed_
-- string literal; and we deal with it in matchLiterals above. Otherwise, it
-- produces a primitive Literal of type matching the original HsLit.
-- In the case of the fixed-width numeric types, we need to wrap here
-- because Literal has an invariant that the literal is in range, while
-- HsLit does not.
hsLitKey :: DynFlags -> HsLit GhcTc -> Literal
hsLitKey dflags :: DynFlags
dflags (HsIntPrim    _ i :: Integer
i) = DynFlags -> Integer -> Literal
mkLitIntWrap  DynFlags
dflags Integer
i
hsLitKey dflags :: DynFlags
dflags (HsWordPrim   _ w :: Integer
w) = DynFlags -> Integer -> Literal
mkLitWordWrap DynFlags
dflags Integer
w
hsLitKey dflags :: DynFlags
dflags (HsInt64Prim  _ i :: Integer
i) = DynFlags -> Integer -> Literal
mkLitInt64Wrap  DynFlags
dflags Integer
i
hsLitKey dflags :: DynFlags
dflags (HsWord64Prim _ w :: Integer
w) = DynFlags -> Integer -> Literal
mkLitWord64Wrap DynFlags
dflags Integer
w
hsLitKey _      (HsCharPrim   _ c :: Char
c) = Char -> Literal
mkLitChar            Char
c
hsLitKey _      (HsFloatPrim  _ f :: FractionalLit
f) = Rational -> Literal
mkLitFloat           (FractionalLit -> Rational
fl_value FractionalLit
f)
hsLitKey _      (HsDoublePrim _ d :: FractionalLit
d) = Rational -> Literal
mkLitDouble          (FractionalLit -> Rational
fl_value FractionalLit
d)
hsLitKey _      (HsString _ s :: FastString
s)     = ByteString -> Literal
LitString (FastString -> ByteString
fastStringToByteString FastString
s)
hsLitKey _      l :: HsLit GhcTc
l                  = String -> SDoc -> Literal
forall a. HasCallStack => String -> SDoc -> a
pprPanic "hsLitKey" (HsLit GhcTc -> SDoc
forall a. Outputable a => a -> SDoc
ppr HsLit GhcTc
l)

{-
************************************************************************
*                                                                      *
                Pattern matching on NPat
*                                                                      *
************************************************************************
-}

matchNPats :: [Id] -> Type -> [EquationInfo] -> DsM MatchResult
matchNPats :: [Id] -> Type -> [EquationInfo] -> DsM MatchResult
matchNPats (var :: Id
var:vars :: [Id]
vars) ty :: Type
ty (eqn1 :: EquationInfo
eqn1:eqns :: [EquationInfo]
eqns)    -- All for the same literal
  = do  { let NPat _ (Located (HsOverLit GhcTc)
-> Located (SrcSpanLess (Located (HsOverLit GhcTc)))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ lit :: SrcSpanLess (Located (HsOverLit GhcTc))
lit) mb_neg :: Maybe (SyntaxExpr GhcTc)
mb_neg eq_chk :: SyntaxExpr GhcTc
eq_chk = EquationInfo -> Pat GhcTc
firstPat EquationInfo
eqn1
        ; CoreExpr
lit_expr <- HsOverLit GhcTc -> DsM CoreExpr
dsOverLit HsOverLit GhcTc
lit
        ; CoreExpr
neg_lit <- case Maybe (SyntaxExpr GhcTc)
mb_neg of
                            Nothing  -> CoreExpr -> DsM CoreExpr
forall (m :: * -> *) a. Monad m => a -> m a
return CoreExpr
lit_expr
                            Just neg :: SyntaxExpr GhcTc
neg -> SyntaxExpr GhcTc -> [CoreExpr] -> DsM CoreExpr
dsSyntaxExpr SyntaxExpr GhcTc
neg [CoreExpr
lit_expr]
        ; CoreExpr
pred_expr <- SyntaxExpr GhcTc -> [CoreExpr] -> DsM CoreExpr
dsSyntaxExpr SyntaxExpr GhcTc
eq_chk [Id -> CoreExpr
forall b. Id -> Expr b
Var Id
var, CoreExpr
neg_lit]
        ; MatchResult
match_result <- [Id] -> Type -> [EquationInfo] -> DsM MatchResult
match [Id]
vars Type
ty ([EquationInfo] -> [EquationInfo]
shiftEqns (EquationInfo
eqn1EquationInfo -> [EquationInfo] -> [EquationInfo]
forall a. a -> [a] -> [a]
:[EquationInfo]
eqns))
        ; MatchResult -> DsM MatchResult
forall (m :: * -> *) a. Monad m => a -> m a
return (CoreExpr -> MatchResult -> MatchResult
mkGuardedMatchResult CoreExpr
pred_expr MatchResult
match_result) }
matchNPats vars :: [Id]
vars _ eqns :: [EquationInfo]
eqns = String -> SDoc -> DsM MatchResult
forall a. HasCallStack => String -> SDoc -> a
pprPanic "matchOneNPat" (([Id], [EquationInfo]) -> SDoc
forall a. Outputable a => a -> SDoc
ppr ([Id]
vars, [EquationInfo]
eqns))

{-
************************************************************************
*                                                                      *
                Pattern matching on n+k patterns
*                                                                      *
************************************************************************

For an n+k pattern, we use the various magic expressions we've been given.
We generate:
\begin{verbatim}
    if ge var lit then
        let n = sub var lit
        in  <expr-for-a-successful-match>
    else
        <try-next-pattern-or-whatever>
\end{verbatim}
-}

matchNPlusKPats :: [Id] -> Type -> [EquationInfo] -> DsM MatchResult
-- All NPlusKPats, for the *same* literal k
matchNPlusKPats :: [Id] -> Type -> [EquationInfo] -> DsM MatchResult
matchNPlusKPats (var :: Id
var:vars :: [Id]
vars) ty :: Type
ty (eqn1 :: EquationInfo
eqn1:eqns :: [EquationInfo]
eqns)
  = do  { let NPlusKPat _ (Located (IdP GhcTc) -> Located (SrcSpanLess (Located Id))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ n1 :: SrcSpanLess (Located Id)
n1) (Located (HsOverLit GhcTc)
-> Located (SrcSpanLess (Located (HsOverLit GhcTc)))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ lit1 :: SrcSpanLess (Located (HsOverLit GhcTc))
lit1) lit2 :: HsOverLit GhcTc
lit2 ge :: SyntaxExpr GhcTc
ge minus :: SyntaxExpr GhcTc
minus
                = EquationInfo -> Pat GhcTc
firstPat EquationInfo
eqn1
        ; CoreExpr
lit1_expr   <- HsOverLit GhcTc -> DsM CoreExpr
dsOverLit HsOverLit GhcTc
lit1
        ; CoreExpr
lit2_expr   <- HsOverLit GhcTc -> DsM CoreExpr
dsOverLit HsOverLit GhcTc
lit2
        ; CoreExpr
pred_expr   <- SyntaxExpr GhcTc -> [CoreExpr] -> DsM CoreExpr
dsSyntaxExpr SyntaxExpr GhcTc
ge    [Id -> CoreExpr
forall b. Id -> Expr b
Var Id
var, CoreExpr
lit1_expr]
        ; CoreExpr
minusk_expr <- SyntaxExpr GhcTc -> [CoreExpr] -> DsM CoreExpr
dsSyntaxExpr SyntaxExpr GhcTc
minus [Id -> CoreExpr
forall b. Id -> Expr b
Var Id
var, CoreExpr
lit2_expr]
        ; let (wraps :: [CoreExpr -> CoreExpr]
wraps, eqns' :: [EquationInfo]
eqns') = (EquationInfo -> (CoreExpr -> CoreExpr, EquationInfo))
-> [EquationInfo] -> ([CoreExpr -> CoreExpr], [EquationInfo])
forall a b c. (a -> (b, c)) -> [a] -> ([b], [c])
mapAndUnzip (Id -> EquationInfo -> (CoreExpr -> CoreExpr, EquationInfo)
shift Id
n1) (EquationInfo
eqn1EquationInfo -> [EquationInfo] -> [EquationInfo]
forall a. a -> [a] -> [a]
:[EquationInfo]
eqns)
        ; MatchResult
match_result <- [Id] -> Type -> [EquationInfo] -> DsM MatchResult
match [Id]
vars Type
ty [EquationInfo]
eqns'
        ; MatchResult -> DsM MatchResult
forall (m :: * -> *) a. Monad m => a -> m a
return  (CoreExpr -> MatchResult -> MatchResult
mkGuardedMatchResult CoreExpr
pred_expr               (MatchResult -> MatchResult) -> MatchResult -> MatchResult
forall a b. (a -> b) -> a -> b
$
                   CoreBind -> MatchResult -> MatchResult
mkCoLetMatchResult (Id -> CoreExpr -> CoreBind
forall b. b -> Expr b -> Bind b
NonRec Id
n1 CoreExpr
minusk_expr)   (MatchResult -> MatchResult) -> MatchResult -> MatchResult
forall a b. (a -> b) -> a -> b
$
                   (CoreExpr -> CoreExpr) -> MatchResult -> MatchResult
adjustMatchResult (((CoreExpr -> CoreExpr)
 -> (CoreExpr -> CoreExpr) -> CoreExpr -> CoreExpr)
-> [CoreExpr -> CoreExpr] -> CoreExpr -> CoreExpr
forall (t :: * -> *) a. Foldable t => (a -> a -> a) -> t a -> a
foldr1 (CoreExpr -> CoreExpr)
-> (CoreExpr -> CoreExpr) -> CoreExpr -> CoreExpr
forall b c a. (b -> c) -> (a -> b) -> a -> c
(.) [CoreExpr -> CoreExpr]
wraps)         (MatchResult -> MatchResult) -> MatchResult -> MatchResult
forall a b. (a -> b) -> a -> b
$
                   MatchResult
match_result) }
  where
    shift :: Id -> EquationInfo -> (CoreExpr -> CoreExpr, EquationInfo)
shift n1 :: Id
n1 eqn :: EquationInfo
eqn@(EqnInfo { eqn_pats :: EquationInfo -> [Pat GhcTc]
eqn_pats = NPlusKPat _ (Located (IdP GhcTc) -> Located (SrcSpanLess (Located Id))
forall a. HasSrcSpan a => a -> Located (SrcSpanLess a)
dL->L _ n :: SrcSpanLess (Located Id)
n) _ _ _ _ : pats :: [Pat GhcTc]
pats })
        = (Id -> Id -> CoreExpr -> CoreExpr
wrapBind SrcSpanLess (Located Id)
Id
n Id
n1, EquationInfo
eqn { eqn_pats :: [Pat GhcTc]
eqn_pats = [Pat GhcTc]
pats })
        -- The wrapBind is a no-op for the first equation
    shift _ e :: EquationInfo
e = String -> SDoc -> (CoreExpr -> CoreExpr, EquationInfo)
forall a. HasCallStack => String -> SDoc -> a
pprPanic "matchNPlusKPats/shift" (EquationInfo -> SDoc
forall a. Outputable a => a -> SDoc
ppr EquationInfo
e)

matchNPlusKPats vars :: [Id]
vars _ eqns :: [EquationInfo]
eqns = String -> SDoc -> DsM MatchResult
forall a. HasCallStack => String -> SDoc -> a
pprPanic "matchNPlusKPats" (([Id], [EquationInfo]) -> SDoc
forall a. Outputable a => a -> SDoc
ppr ([Id]
vars, [EquationInfo]
eqns))