Commit b990f656 authored by Gabor Greif's avatar Gabor Greif 💬

More typos in comments [skip ci]

parent 512f157c
......@@ -451,7 +451,7 @@ cpeBind top_lvl env (Rec pairs)
where
(bndrs, rhss) = unzip pairs
-- Flatten all the floats, and the currrent
-- Flatten all the floats, and the current
-- group into a single giant Rec
add_float (FloatLet (NonRec b r)) prs2 = (b,r) : prs2
add_float (FloatLet (Rec prs1)) prs2 = prs1 ++ prs2
......
......@@ -98,7 +98,7 @@ mkDFunUnfolding bndrs con ops
= DFunUnfolding { df_bndrs = bndrs
, df_con = con
, df_args = map occurAnalyseExpr ops }
-- See Note [Occurrrence analysis of unfoldings]
-- See Note [Occurrence analysis of unfoldings]
mkWwInlineRule :: CoreExpr -> Arity -> Unfolding
mkWwInlineRule expr arity
......@@ -238,7 +238,7 @@ mkCoreUnfolding :: UnfoldingSource -> Bool -> CoreExpr
-- Occurrence-analyses the expression before capturing it
mkCoreUnfolding src top_lvl expr guidance
= CoreUnfolding { uf_tmpl = occurAnalyseExpr expr,
-- See Note [Occurrrence analysis of unfoldings]
-- See Note [Occurrence analysis of unfoldings]
uf_src = src,
uf_is_top = top_lvl,
uf_is_value = exprIsHNF expr,
......@@ -257,7 +257,7 @@ mkUnfolding :: DynFlags -> UnfoldingSource
-- Occurrence-analyses the expression before capturing it
mkUnfolding dflags src is_top_lvl is_bottoming expr
= CoreUnfolding { uf_tmpl = occurAnalyseExpr expr,
-- See Note [Occurrrence analysis of unfoldings]
-- See Note [Occurrence analysis of unfoldings]
uf_src = src,
uf_is_top = is_top_lvl,
uf_is_value = exprIsHNF expr,
......@@ -646,7 +646,7 @@ sizeExpr dflags bOMB_OUT_SIZE top_args expr
--
-- IMPORATANT: *do* charge 1 for the alternative, else we
-- find that giant case nests are treated as practically free
-- A good example is Foreign.C.Error.errrnoToIOError
-- A good example is Foreign.C.Error.errnoToIOError
------------
-- Cost to allocate binding with given binder
......
......@@ -1428,7 +1428,7 @@ repBinds b@(HsIPBinds _) = notHandled "Implicit parameters" (ppr b)
repBinds (HsValBinds decs)
= do { let { bndrs = hsSigTvBinders decs ++ collectHsValBinders decs }
-- No need to worrry about detailed scopes within
-- No need to worry about detailed scopes within
-- the binding group, because we are talking Names
-- here, so we can safely treat it as a mutually
-- recursive group
......
......@@ -253,7 +253,7 @@ initDsTc thing_inside
initTcDsForSolver :: TcM a -> DsM (Messages, Maybe a)
-- Spin up a TcM context so that we can run the constraint solver
-- Returns any error messages generated by the constraint solver
-- and (Just res) if no error happened; Nothing if an error happened
--
-- Simon says: I'm not very happy about this. We spin up a complete TcM monad
-- only to immediately refine it to a TcS monad.
......
......@@ -1591,7 +1591,7 @@ extendInteractiveContext ictxt new_tythings new_cls_insts new_fam_insts defaults
}
where
-- Discard old instances that have been fully overrridden
-- Discard old instances that have been fully overridden
-- See Note [Override identical instances in GHCi]
(cls_insts, fam_insts) = ic_instances ictxt
old_cls_insts = filterOut (\i -> any (identicalClsInstHead i) new_cls_insts) cls_insts
......
......@@ -691,7 +691,7 @@ chooseExternalIds hsc_env mod omit_prags expose_all binds implicit_binds imp_id_
init_occ_env = initTidyOccEnv avoids
search :: [(Id,Id)] -- The work-list: (external id, referrring id)
search :: [(Id,Id)] -- The work-list: (external id, referring id)
-- Make a tidy, external Name for the external id,
-- add it to the UnfoldEnv, and do the same for the
-- transitive closure of Ids it refers to
......
......@@ -1472,7 +1472,7 @@ chooses a loop breaker. Suppose in iteration 1 it choose g as the loop
breaker. That means it is free to inline f.
Suppose that GHC decides to inline f in the branches of the case, but
(for some reason; eg it is not satureated) in the rhs of g. So we get
(for some reason; eg it is not saturated) in the rhs of g. So we get
let rec { f = ...g...g...
; g = ...f...f... }
......@@ -1900,7 +1900,7 @@ zapDetailsIf False uds = uds
{-
Note [Use one-shot information]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The occurrrence analyser propagates one-shot-lambda information in two
The occurrence analyser propagates one-shot-lambda information in two
situations:
* Applications: eg build (\c n -> blah)
......
......@@ -615,7 +615,7 @@ we keep? More subtle than you might think!
IRReplace, to avoid unnecessary munging of the inert set.
Doing the depth-check for implicit parameters, rather than making the work item
always overrride, is important. Consider
always override, is important. Consider
data T a where { T1 :: (?x::Int) => T Int; T2 :: T a }
......
......@@ -857,7 +857,7 @@ type TcIdBinderStack = [TcIdBinder]
data TcIdBinder
= TcIdBndr
TcId
TopLevelFlag -- Tells whether the bindind is syntactically top-level
TopLevelFlag -- Tells whether the binding is syntactically top-level
-- (The monomorphic Ids for a recursive group count
-- as not-top-level for this purpose.)
| TcIdBndr_ExpType -- Variant that allows the type to be specified as
......
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