Commit 34515e7c authored by Alex D's avatar Alex D 🍄

Fix random typos [skip ci]

parent 2f5ed225
Pipeline #12896 skipped
...@@ -1455,7 +1455,7 @@ patterns in each equation. ...@@ -1455,7 +1455,7 @@ patterns in each equation.
-} -}
data MatchGroup p body data MatchGroup p body
= MG { mg_ext :: XMG p body -- Posr typechecker, types of args and result = MG { mg_ext :: XMG p body -- Post-typechecker, types of args and result
, mg_alts :: Located [LMatch p body] -- The alternatives , mg_alts :: Located [LMatch p body] -- The alternatives
, mg_origin :: Origin } , mg_origin :: Origin }
-- The type is the type of the entire group -- The type is the type of the entire group
......
...@@ -414,7 +414,7 @@ cgCase (StgApp v []) _ (PrimAlt _) alts ...@@ -414,7 +414,7 @@ cgCase (StgApp v []) _ (PrimAlt _) alts
Consider Consider
case (x :: HValue) |> co of (y :: MutVar# Int) case (x :: HValue) |> co of (y :: MutVar# Int)
DEFAULT -> ... DEFAULT -> ...
We want to gnerate an assignment We want to generate an assignment
y := x y := x
We want to allow this assignment to be generated in the case when the We want to allow this assignment to be generated in the case when the
types are compatible, because this allows some slightly-dodgy but types are compatible, because this allows some slightly-dodgy but
......
...@@ -67,7 +67,7 @@ visitSwitches dflags block ...@@ -67,7 +67,7 @@ visitSwitches dflags block
-- This is important as the expression could contain expensive code like -- This is important as the expression could contain expensive code like
-- memory loads or divisions which we REALLY don't want to duplicate. -- memory loads or divisions which we REALLY don't want to duplicate.
-- This happend in parts of the handwritten RTS Cmm code. See also #16933 -- This happened in parts of the handwritten RTS Cmm code. See also #16933
-- See Note [Floating switch expressions] -- See Note [Floating switch expressions]
floatSwitchExpr :: DynFlags -> CmmExpr -> UniqSM (Block CmmNode O O, CmmExpr) floatSwitchExpr :: DynFlags -> CmmExpr -> UniqSM (Block CmmNode O O, CmmExpr)
......
...@@ -138,7 +138,7 @@ a dominator analysis, using the Dataflow Engine. ...@@ -138,7 +138,7 @@ a dominator analysis, using the Dataflow Engine.
* The CLabel for the entry-point/closure reveals whether g is * The CLabel for the entry-point/closure reveals whether g is
a CAF (or refers to CAFs). See the IdLabel constructor of CLabel. a CAF (or refers to CAFs). See the IdLabel constructor of CLabel.
* The CAF-ness of the original top-level defininions is figured out * The CAF-ness of the original top-level definitions is figured out
(by TidyPgm) before we generate C--. This CafInfo is only set for (by TidyPgm) before we generate C--. This CafInfo is only set for
top-level Ids; nested bindings stay with MayHaveCafRefs. top-level Ids; nested bindings stay with MayHaveCafRefs.
......
...@@ -1790,7 +1790,7 @@ repLambda (dL->L _ (Match { m_pats = ps ...@@ -1790,7 +1790,7 @@ repLambda (dL->L _ (Match { m_pats = ps
do { xs <- repLPs ps; body <- repLE e; repLam xs body }) do { xs <- repLPs ps; body <- repLE e; repLam xs body })
; wrapGenSyms ss lam } ; wrapGenSyms ss lam }
repLambda (dL->L _ m) = notHandled "Guarded labmdas" (pprMatch m) repLambda (dL->L _ m) = notHandled "Guarded lambdas" (pprMatch m)
----------------------------------------------------------------------------- -----------------------------------------------------------------------------
...@@ -2117,7 +2117,7 @@ repMultiIf (MkC alts) = rep2 multiIfEName [alts] ...@@ -2117,7 +2117,7 @@ repMultiIf (MkC alts) = rep2 multiIfEName [alts]
repLetE :: Core [TH.DecQ] -> Core TH.ExpQ -> DsM (Core TH.ExpQ) repLetE :: Core [TH.DecQ] -> Core TH.ExpQ -> DsM (Core TH.ExpQ)
repLetE (MkC ds) (MkC e) = rep2 letEName [ds, e] repLetE (MkC ds) (MkC e) = rep2 letEName [ds, e]
repCaseE :: Core TH.ExpQ -> Core [TH.MatchQ] -> DsM( Core TH.ExpQ) repCaseE :: Core TH.ExpQ -> Core [TH.MatchQ] -> DsM (Core TH.ExpQ)
repCaseE (MkC e) (MkC ms) = rep2 caseEName [e, ms] repCaseE (MkC e) (MkC ms) = rep2 caseEName [e, ms]
repDoE :: Core [TH.StmtQ] -> DsM (Core TH.ExpQ) repDoE :: Core [TH.StmtQ] -> DsM (Core TH.ExpQ)
......
...@@ -208,7 +208,7 @@ names in PrelNames, so they use wTcQual, wDataQual, etc ...@@ -208,7 +208,7 @@ names in PrelNames, so they use wTcQual, wDataQual, etc
-- See also Note [Known-key names] -- See also Note [Known-key names]
wiredInTyCons :: [TyCon] wiredInTyCons :: [TyCon]
wiredInTyCons = [ -- Units are not treated like other tuples, because then wiredInTyCons = [ -- Units are not treated like other tuples, because they
-- are defined in GHC.Base, and there's only a few of them. We -- are defined in GHC.Base, and there's only a few of them. We
-- put them in wiredInTyCons so that they will pre-populate -- put them in wiredInTyCons so that they will pre-populate
-- the name cache, so the parser in isBuiltInOcc_maybe doesn't -- the name cache, so the parser in isBuiltInOcc_maybe doesn't
......
...@@ -1790,7 +1790,7 @@ For example, when we see a call `reverse (f xs)`, we know that we calling ...@@ -1790,7 +1790,7 @@ For example, when we see a call `reverse (f xs)`, we know that we calling
reverse :: forall a. [a] -> [a] reverse :: forall a. [a] -> [a]
So we know that the argument `f xs` must be a "list of something". But what is So we know that the argument `f xs` must be a "list of something". But what is
the "something"? We don't know until we explore the `f xs` a bit more. So we set the "something"? We don't know until we explore the `f xs` a bit more. So we set
out what we do know at the call of `reverse` by instantiate its type with a fresh out what we do know at the call of `reverse` by instantiating its type with a fresh
meta tyvar, `alpha` say. So now the type of the argument `f xs`, and of the meta tyvar, `alpha` say. So now the type of the argument `f xs`, and of the
result, is `[alpha]`. The unification variable `alpha` stands for the result, is `[alpha]`. The unification variable `alpha` stands for the
as-yet-unknown type of the elements of the list. as-yet-unknown type of the elements of the list.
......
...@@ -2214,7 +2214,7 @@ isLiftedTypeKindTyConName = (`hasKey` liftedTypeKindTyConKey) ...@@ -2214,7 +2214,7 @@ isLiftedTypeKindTyConName = (`hasKey` liftedTypeKindTyConKey)
-- (similar to a @dfun@ does that for a class instance). -- (similar to a @dfun@ does that for a class instance).
-- --
-- * Tuples are implicit iff they have a wired-in name -- * Tuples are implicit iff they have a wired-in name
-- (namely: boxed and unboxed tupeles are wired-in and implicit, -- (namely: boxed and unboxed tuples are wired-in and implicit,
-- but constraint tuples are not) -- but constraint tuples are not)
isImplicitTyCon :: TyCon -> Bool isImplicitTyCon :: TyCon -> Bool
isImplicitTyCon (FunTyCon {}) = True isImplicitTyCon (FunTyCon {}) = True
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment