- ghc-commits - Haskell.org

[Git][ghc/ghc] Pushed new branch wip/maralorn-master-patch-45109
by maralorn (＠maralorn) 02 Jan '26

02 Jan '26

maralorn pushed new branch wip/maralorn-master-patch-45109 at Glasgow Haskell Compiler / GHC -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/tree/wip/maralorn-master-patch-45109 You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/spj-try-opt-coercion] Serious attempt to avoid duplicating large coercions [skip ci]
by Simon Peyton Jones (＠simonpj) 02 Jan '26

02 Jan '26

Simon Peyton Jones pushed to branch wip/spj-try-opt-coercion at Glasgow Haskell Compiler / GHC Commits: 760fe6e0 by Simon Peyton Jones at 2026-01-02T14:02:20+00:00 Serious attempt to avoid duplicating large coercions [skip ci] - - - - - 8 changed files: - compiler/GHC/Core/Coercion.hs - compiler/GHC/Core/Opt/Simplify/Env.hs - compiler/GHC/Core/Opt/Simplify/Iteration.hs - compiler/GHC/Core/Opt/Simplify/Utils.hs - compiler/GHC/Core/Ppr.hs - compiler/GHC/Core/TyCo/Rep.hs - compiler/GHC/Core/Utils.hs - compiler/GHC/CoreToStg.hs Changes: ===================================== compiler/GHC/Core/Coercion.hs ===================================== @@ -1,3 +1,5 @@ +{-# LANGUAGE MagicHash #-} + {- (c) The University of Glasgow 2006 -} @@ -23,6 +25,7 @@ module GHC.Core.Coercion ( coercionType, mkCoercionType, coercionKind, coercionLKind, coercionRKind,coercionKinds, coercionRole, coercionKindRole, + coercionIsSmall, -- ** Constructing coercions mkGReflCo, mkGReflMCo, mkReflCo, mkRepReflCo, mkNomReflCo, @@ -169,6 +172,8 @@ import qualified Data.Monoid as Monoid import Data.List.NonEmpty ( NonEmpty (..) ) import Control.DeepSeq +import GHC.Exts + {- %************************************************************************ %* * @@ -2468,6 +2473,40 @@ seqCos :: [Coercion] -> () seqCos [] = () seqCos (co:cos) = seqCo co `seq` seqCos cos +coercionIsSmall :: Coercion -> Bool +-- This function should return False quickly on a big coercion +-- It should /not/ traverse the big coercion! +coercionIsSmall co + = not (isTrue# ((go co 100#) <# 0#)) + where + go :: Coercion -> Int# -> Int# + go _co n | isTrue# (n <# 0#) = n + go (Refl {}) n = dec n + go (GRefl _ _ mco) n = go_mco mco (dec n) + go (TyConAppCo _ _ cos) n = go_cos cos (dec n) + go (AxiomCo _ cos) n = go_cos cos (dec n) + go (UnivCo _ _ _ _ cos) n = go_cos cos (dec n) + go (AppCo co1 co2) n = go co1 (go co2 (dec n)) + go (CoVarCo {}) n = dec n + go (HoleCo {}) n = dec n + go (SymCo co) n = go co (dec n) + go (KindCo co) n = go co (dec n) + go (SubCo co) n = go co (dec n) + go (TransCo co1 co2) n = go co1 (go co2 (dec n)) + go (SelCo _ co) n = go co (dec n) + go (LRCo _ co) n = go co (dec n) + go (InstCo co1 co2) n = go co1 (go co2 (dec n)) + go (ForAllCo _ _ _ kco co) n = go co (go_mco kco (dec n)) + go (FunCo _ _ _ mco aco rco) n = go mco (go aco (go rco (dec n))) + + go_cos [] n = n + go_cos (co:cos) n = go_cos cos (go co n) + + go_mco MRefl n = dec n + go_mco (MCo co) n = go co n + + dec n = n -# 1# + {- %************************************************************************ %* * ===================================== compiler/GHC/Core/Opt/Simplify/Env.hs ===================================== @@ -845,10 +845,8 @@ unitLetFloat bind = assert (all (not . isJoinId) (bindersOf bind)) $ where flag (Rec {}) = FltLifted flag (NonRec bndr rhs) - | not (isStrictId bndr) = FltLifted - | exprIsTickedString rhs = FltLifted - -- String literals can be floated freely. - -- See Note [Core top-level string literals] in GHC.Core. + | exprIsTopLevelBindable rhs (idType bndr) = FltLifted + -- Things that can float freely, including to top level | exprOkForSpeculation rhs = FltOkSpec -- Unlifted, and lifted but ok-for-spec (eg HNF) | otherwise = FltCareful ===================================== compiler/GHC/Core/Opt/Simplify/Iteration.hs ===================================== @@ -597,15 +597,20 @@ tryCastWorkerWrapper env bind_cxt old_bndr bndr (Cast rhs co) work_id = mkLocalIdWithInfo work_name ManyTy work_ty work_info is_strict = isStrictId bndr + ; (co_floats, co') <- makeCoTrivial co + ; (rhs_floats, work_rhs) <- prepareBinding env top_lvl is_rec is_strict work_id (emptyFloats env) rhs ; work_unf <- mk_worker_unfolding top_lvl work_id work_rhs + ; let work_id_w_unf = work_id `setIdUnfolding` work_unf - floats = rhs_floats `addLetFloats` - unitLetFloat (NonRec work_id_w_unf work_rhs) + work_float = unitLetFloat (NonRec work_id_w_unf work_rhs) - triv_rhs = Cast (Var work_id_w_unf) co + floats = rhs_floats `addLetFloats` + (co_floats `addLetFlts` work_float) + + triv_rhs = Cast (Var work_id_w_unf) co' ; if postInlineUnconditionally env bind_cxt old_bndr bndr triv_rhs -- Almost always True, because the RHS is trivial @@ -715,12 +720,15 @@ prepareBinding env top_lvl is_rec strict_bind bndr rhs_floats rhs ; let all_floats = rhs_floats1 `addLetFloats` anf_floats ; if doFloatFromRhs (seFloatEnable env) top_lvl is_rec strict_bind all_floats rhs2 then -- Float! + simplTrace "prepareBinding:yes" (ppr all_floats $$ text "rhs" <+> ppr rhs2) $ do { tick LetFloatFromLet ; return (all_floats, rhs2) } else -- Abandon floating altogether; revert to original rhs -- Since we have already built rhs1, we just need to add -- rhs_floats1 to it + simplTrace "prepareBinding:no" (vcat [ ppr all_floats + , text "rhs" <+> ppr rhs2 ]) $ return (emptyFloats env, wrapFloats rhs_floats1 rhs1) } {- Note [prepareRhs] @@ -753,7 +761,9 @@ prepareRhs :: HasDebugCallStack -- x = Just a -- See Note [prepareRhs] prepareRhs env top_lvl occ rhs0 - | is_expandable = anfise rhs0 + | is_expandable = do { (flts,rhs) <- anfise rhs0 + ; pprTrace "prepareRhs" (ppr rhs0 $$ text "new" <+> ppr rhs) $ + return (flts, rhs) } | otherwise = return (emptyLetFloats, rhs0) where -- We can't use exprIsExpandable because the WHOLE POINT is that @@ -762,7 +772,8 @@ prepareRhs env top_lvl occ rhs0 -- just say no! is_expandable = go rhs0 0 where - go (Var fun) n_val_args = isExpandableApp fun n_val_args + go (Var fun) n_val_args = pprTrace "is_exp" (ppr fun <+> ppr n_val_args $$ ppr (isExpandableApp fun n_val_args)) $ + isExpandableApp fun n_val_args go (App fun arg) n_val_args | isTypeArg arg = go fun n_val_args | otherwise = go fun (n_val_args + 1) @@ -772,8 +783,9 @@ prepareRhs env top_lvl occ rhs0 anfise :: OutExpr -> SimplM (LetFloats, OutExpr) anfise (Cast rhs co) - = do { (floats, rhs') <- anfise rhs - ; return (floats, Cast rhs' co) } + = do { (floats1, rhs') <- anfise rhs + ; (floats2, co') <- makeCoTrivial co + ; return (floats1 `addLetFlts` floats2, Cast rhs' co') } anfise (App fun (Type ty)) = do { (floats, rhs') <- anfise fun ; return (floats, App rhs' (Type ty)) } @@ -818,13 +830,19 @@ makeTrivial :: HasDebugCallStack -- For the Demand argument, see Note [Keeping demand info in StrictArg Plan A] makeTrivial env top_lvl dmd occ_fs expr | exprIsTrivial expr -- Already trivial - || not (bindingOk top_lvl expr expr_ty) -- Cannot trivialise - -- See Note [Cannot trivialise] - = return (emptyLetFloats, expr) + = simplTrace "makeTrivial:triv" (ppr expr) $ + return (emptyLetFloats, expr) + + | not (bindingOk top_lvl expr expr_ty) -- Cannot trivialise + -- See Note [Cannot trivialise] + = simplTrace "makeTrivial:cannot" (ppr expr) $ + return (emptyLetFloats, expr) | Cast expr' co <- expr - = do { (floats, triv_expr) <- makeTrivial env top_lvl dmd occ_fs expr' - ; return (floats, Cast triv_expr co) } + = do { (floats1, triv_co) <- makeCoTrivial co + ; (floats2, triv_expr) <- makeTrivial env top_lvl dmd occ_fs expr' + ; simplTrace "makeTrivial:co" (ppr (Cast triv_expr triv_co)) $ + return (floats1 `addLetFlts` floats2, Cast triv_expr triv_co) } | otherwise -- 'expr' is not of form (Cast e co) = do { (floats, expr1) <- prepareRhs env top_lvl occ_fs expr @@ -850,6 +868,17 @@ makeTrivial env top_lvl dmd occ_fs expr id_info = vanillaIdInfo `setDemandInfo` dmd expr_ty = exprType expr +makeCoTrivial :: OutCoercion -> SimplM (LetFloats, OutCoercion) +makeCoTrivial co + | coercionIsSmall co + = return (emptyLetFloats, co) + | otherwise + = do { co_uniq <- getUniqueM + ; let co_name = mkSystemVarName co_uniq (fsLit "aco") + co_var = mkLocalCoVar co_name (coercionType co) + ; return ( unitLetFloat (NonRec co_var (Coercion co)) + , mkCoVarCo co_var ) } + bindingOk :: TopLevelFlag -> CoreExpr -> Type -> Bool -- True iff we can have a binding of this expression at this level -- Precondition: the type is the type of the expression @@ -1259,7 +1288,7 @@ simplExprF1 env (Let (NonRec bndr rhs) body) cont | Just env' <- preInlineUnconditionally env NotTopLevel bndr rhs env -- Because of the let-can-float invariant, it's ok to -- inline freely, or to drop the binding if it is dead. - = do { simplTrace "SimplBindr:inline-uncond2" (ppr bndr) $ + = do { simplTrace "SimplBindr:inline-uncond2" (ppr bndr <+> ppr rhs) $ tick (PreInlineUnconditionally bndr) ; simplExprF env' body cont } @@ -1758,12 +1787,12 @@ simpl_lam env bndr body (ApplyToTy { sc_arg_ty = arg_ty, sc_cont = cont }) ; simplLam (extendTvSubst env bndr arg_ty) body cont } -- Coercion beta-reduction -simpl_lam env bndr body (ApplyToVal { sc_arg = Coercion arg_co, sc_env = arg_se - , sc_cont = cont }) - = assertPpr (isCoVar bndr) (ppr bndr) $ - do { tick (BetaReduction bndr) - ; let arg_co' = substCo (arg_se `setInScopeFromE` env) arg_co - ; simplLam (extendCvSubst env bndr arg_co') body cont } +-- simpl_lam env bndr body (ApplyToVal { sc_arg = Coercion arg_co, sc_env = arg_se +-- , sc_cont = cont }) +-- = assertPpr (isCoVar bndr) (ppr bndr) $ +-- do { tick (BetaReduction bndr) +-- ; let arg_co' = substCo (arg_se `setInScopeFromE` env) arg_co +-- ; simplLam (extendCvSubst env bndr arg_co') body cont } -- Value beta-reduction -- This works for /coercion/ lambdas too @@ -1791,7 +1820,7 @@ simpl_lam env bndr body (ApplyToVal { sc_arg = arg, sc_env = arg_se , not ( isSimplified dup && -- See (SR2) in Note [Avoiding simplifying repeatedly] not (exprIsTrivial arg) && not (isDeadOcc (idOccInfo bndr)) ) - -> do { simplTrace "SimplBindr:inline-uncond3" (ppr bndr) $ + -> do { simplTrace "SimplBindr:inline-uncond3" (ppr bndr <+> ppr arg) $ tick (PreInlineUnconditionally bndr) ; simplLam env' body cont } @@ -3688,9 +3717,9 @@ knownCon env scrut dc_floats dc dc_ty_args dc_args bndr bs rhs cont = assert (isTyVar b ) bind_args (extendTvSubst env' b ty) bs' args - bind_args env' (b:bs') (Coercion co : args) - = assert (isCoVar b ) - bind_args (extendCvSubst env' b co) bs' args +-- bind_args env' (b:bs') (Coercion co : args) +-- = assert (isCoVar b ) +-- bind_args (extendCvSubst env' b co) bs' args bind_args env' (b:bs') (arg : args) = assert (isId b) $ ===================================== compiler/GHC/Core/Opt/Simplify/Utils.hs ===================================== @@ -1646,6 +1646,7 @@ postInlineUnconditionally env bind_cxt old_bndr bndr rhs | isStableUnfolding unfolding = False -- Note [Stable unfoldings and postInlineUnconditionally] | isTopLevel (bindContextLevel bind_cxt) = False -- Note [Top level and postInlineUnconditionally] + | isCoVar bndr = False | exprIsTrivial rhs = True | BC_Join {} <- bind_cxt = False -- See point (1) of Note [Duplicating join points] -- in GHC.Core.Opt.Simplify.Iteration ===================================== compiler/GHC/Core/Ppr.hs ===================================== @@ -191,7 +191,7 @@ ppr_expr :: OutputableBndr b => (SDoc -> SDoc) -> Expr b -> SDoc ppr_expr add_par (Var id) = ppr_id_occ add_par id ppr_expr add_par (Type ty) = add_par (text "TYPE:" <+> ppr ty) -- Weird -ppr_expr add_par (Coercion co) = add_par (text "CO:" <+> ppr co) +ppr_expr add_par (Coercion co) = add_par (text "CO:" <+> pprOptCo co) ppr_expr add_par (Lit lit) = pprLiteral add_par lit ppr_expr add_par (Cast expr co) ===================================== compiler/GHC/Core/TyCo/Rep.hs ===================================== @@ -815,7 +815,7 @@ type CoercionN = Coercion -- always Nominal type CoercionR = Coercion -- always Representational type CoercionP = Coercion -- always Phantom -type MCoercionN = MCoercion -- alwyas Nominal +type MCoercionN = MCoercion -- always Nominal type MCoercionR = MCoercion -- always Representational {- Note [KindCoercion] ===================================== compiler/GHC/Core/Utils.hs ===================================== @@ -1280,37 +1280,44 @@ it off at source. -} {-# INLINE trivial_expr_fold #-} -trivial_expr_fold :: (Id -> r) -> (Literal -> r) -> r -> r -> CoreExpr -> r +trivial_expr_fold :: (Id -> r) -- Var + -> (Literal -> r) -- Lit + -> (Type -> r) -- Type + -> (Coercion -> r) -- Coercion + -> (r -> Coercion -> r) -- Cast + -> r -- Anything else + -> CoreExpr -> r -- ^ The worker function for Note [exprIsTrivial] and Note [getIdFromTrivialExpr] -- This is meant to have the code of both functions in one place and make it -- easy to derive custom predicates. -- --- (trivial_expr_fold k_id k_triv k_not_triv e) +-- (trivial_expr_fold k_id k_ty k_co k_not_triv e) -- * returns (k_id x) if `e` is a variable `x` (with trivial wrapping) -- * returns (k_lit x) if `e` is a trivial literal `l` (with trivial wrapping) --- * returns k_triv if `e` is a literal, type, or coercion (with trivial wrapping) +-- * returns (k_ty ty) if `e` is a type (with trivial wrapping) +-- * returns (k_co co) if `e` is a coercion (with trivial wrapping) -- * returns k_not_triv otherwise -- -- where "trivial wrapping" is -- * Type application or abstraction -- * Ticks other than `tickishIsCode` -- * `case e of {}` an empty case -trivial_expr_fold k_id k_lit k_triv k_not_triv = go +trivial_expr_fold k_id k_lit k_ty k_co k_cast k_not_triv = go where -- If you change this function, be sure to change -- SetLevels.notWorthFloating as well! -- (Or yet better: Come up with a way to share code with this function.) go (Var v) = k_id v -- See Note [Variables are trivial] go (Lit l) | litIsTrivial l = k_lit l - go (Type _) = k_triv - go (Coercion _) = k_triv + go (Type ty) = k_ty ty + go (Coercion co) = k_co co + go (Cast e co) = k_cast (go e) co go (App f arg) | not (isRuntimeArg arg) = go f | exprIsUnaryClassFun f = go arg | otherwise = k_not_triv go (Lam b e) | not (isRuntimeVar b) = go e go (Tick t e) | not (tickishIsCode t) = go e -- See Note [Tick trivial] - go (Cast e _) = go e go (Case e b _ as) | null as = go e -- See Note [Empty case is trivial] @@ -1319,7 +1326,14 @@ trivial_expr_fold k_id k_lit k_triv k_not_triv = go go _ = k_not_triv exprIsTrivial :: CoreExpr -> Bool -exprIsTrivial e = trivial_expr_fold (const True) (const True) True False e +exprIsTrivial e = trivial_expr_fold + (const True) -- Ids + (const True) -- Literals + (const True) -- Types + coercionIsSmall -- Coercions + (\ r co -> pprTrace "exprIsTrivial" (ppr (coercionIsSmall co) $$ ppr co) $ + r && coercionIsSmall co) -- Casts + False e {- Note [getIdFromTrivialExpr] @@ -1340,12 +1354,16 @@ T12076lit for an example where this matters. getIdFromTrivialExpr :: HasDebugCallStack => CoreExpr -> Id -- See Note [getIdFromTrivialExpr] -getIdFromTrivialExpr e = trivial_expr_fold id (const panic) panic panic e +getIdFromTrivialExpr e + = trivial_expr_fold id panic panic panic panic panic e where + panic :: forall a. a panic = pprPanic "getIdFromTrivialExpr" (ppr e) getIdFromTrivialExpr_maybe :: CoreExpr -> Maybe Id -getIdFromTrivialExpr_maybe e = trivial_expr_fold Just (const Nothing) Nothing Nothing e +getIdFromTrivialExpr_maybe e + = trivial_expr_fold Just (const Nothing) (const Nothing) + (const Nothing) (\ r _ -> r) Nothing e {- ********************************************************************* * * @@ -2371,6 +2389,13 @@ exprIsTopLevelBindable expr ty -- as the latter would panic. || exprIsTickedString expr + || exprIsCoercion expr + +-- | Check if the expression is a literal coercion; these can appear at top level +exprIsCoercion :: CoreExpr -> Bool +exprIsCoercion (Coercion {}) = True +exprIsCoercion _ = False + -- | Check if the expression is zero or more Ticks wrapped around a literal -- string. exprIsTickedString :: CoreExpr -> Bool ===================================== compiler/GHC/CoreToStg.hs ===================================== @@ -598,8 +598,10 @@ getStgArgFromTrivialArg :: HasDebugCallStack => CoreArg -> StgArg -- CoreArgs may not immediately look trivial, e.g., `case e of {}` or -- `case unsafeequalityProof of UnsafeRefl -> e` might intervene. -- Good thing we can just call `trivial_expr_fold` here. -getStgArgFromTrivialArg e = trivial_expr_fold StgVarArg StgLitArg panic panic e +getStgArgFromTrivialArg e = trivial_expr_fold StgVarArg StgLitArg + panic panic panic panic e where + panic :: forall a. a panic = pprPanic "getStgArgFromTrivialArg" (ppr e) coreToStgArgs :: [CoreArg] -> CtsM ([StgArg], [StgTickish]) View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/760fe6e02a2b9be0ef0b23d73a9b9fd… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/760fe6e02a2b9be0ef0b23d73a9b9fd… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/spj-unf-size] Wibble unused variables
by Simon Peyton Jones (＠simonpj) 02 Jan '26

02 Jan '26

Simon Peyton Jones pushed to branch wip/spj-unf-size at Glasgow Haskell Compiler / GHC Commits: 41f2321f by Simon Peyton Jones at 2026-01-02T09:29:45+00:00 Wibble unused variables - - - - - 1 changed file: - compiler/GHC/Core/TyCo/Subst.hs Changes: ===================================== compiler/GHC/Core/TyCo/Subst.hs ===================================== @@ -510,13 +510,13 @@ zipCoEnv cvs cos instance Outputable Subst where ppr (Subst in_scope ids tvs cvs) = char '<' <+> - vcat [ -- InScope =" <+> in_scope_doc, + vcat [ -- InScope =" <+> _in_scope_doc, text " IdSubst =" <+> ppr ids, text " TvSubst =" <+> ppr tvs, text " CvSubst =" <+> ppr cvs ] <+>char '>' where - in_scope_doc = pprVarSet (getInScopeVars in_scope) (braces . fsep . map ppr) + _in_scope_doc = pprVarSet (getInScopeVars in_scope) (braces . fsep . map ppr) {- %************************************************************************ View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/41f2321f344a8da748e0c75d26bddaa… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/41f2321f344a8da748e0c75d26bddaa… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc] Pushed new branch wip/llvm-o3
by Cheng Shao (＠TerrorJack) 02 Jan '26

02 Jan '26

Cheng Shao pushed new branch wip/llvm-o3 at Glasgow Haskell Compiler / GHC -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/tree/wip/llvm-o3 You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/spj-try-opt-coercion] Wibbles
by Simon Peyton Jones (＠simonpj) 02 Jan '26

02 Jan '26

Simon Peyton Jones pushed to branch wip/spj-try-opt-coercion at Glasgow Haskell Compiler / GHC Commits: b8ca7215 by Simon Peyton Jones at 2026-01-01T23:30:49+00:00 Wibbles Draft commit message Drastically reduce the use of the coercion optimiser This MR addresess #26679 by calling the coercion optimiser much less often; the coercion optimiser is expensive, and often ineffective, especially when it is called repeatedly. See Note [Coercion optimisation] in GHC.Core.Corecion.Opt. Specifically * Make coercion optimisation into its own pass, controlled by its own flag `-fopt-coercion` like any other pass. The pass runs early in the pipeline. * The Simplifier now contents itself with merely applying the current substitution to a coercion, and checking for reflexivity. * Kill off OptCoercionOpts, which is now unused. Another important, but only loosely related, improvement * In `GHC.Core.Subst.substIdBndr`, `GHC.Core.TyCo.Subst.substTyVarBndrUsing`, and `GHC.Core.TyCo.Subst.substTyVarBndrUsing`, check for an empty substitution. This keeps substitutions empty in the no-op case. See Note [Keeping the substitution empty] in GHC.Core.TyCo.Subst Compile time improves. Here are the compile-time allocation change over 1%: Baseline Test value Change ------------------------------------------------------------ CoOpt_Singletons(normal) 721,677,974 -7.9% GOOD LargeRecord(normal) 1,268,094,410 -20.4% GOOD T12545(normal) 772,150,124 -9.2% T12707(normal) 777,720,918 -1.5% GOOD T14766(normal) 918,228,179 -50.2% GOOD T15703(normal) 318,141,541 +1.0% BAD T18223(normal) 371,496,473 -7.6% GOOD T1969(normal) 670,830,326 +2.2% BAD T20261(normal) 573,444,953 -2.2% T24984(normal) 87,836,660 -1.5% T3064(normal) 171,636,592 -6.2% GOOD T5030(normal) 148,301,062 -16.4% GOOD T5321Fun(normal) 263,120,022 -3.3% GOOD T8095(normal) 777,033,006 -71.3% GOOD T9020(optasm) 222,159,574 -2.5% GOOD T9630(normal) 873,422,584 -15.4% GOOD T9872b(normal) 1,906,890,318 -2.9% GOOD T9872b_defer(normal) 2,878,170,737 -2.1% GOOD T9872d(normal) 356,978,798 -7.7% GOOD TcPlugin_RewritePerf(normal) 2,132,138,060 -2.6% GOOD geo. mean -2.7% minimum -71.3% maximum +2.2% Metric Decrease: CoOpt_Singletons LargeRecord T12707 T14766 T18223 T3064 T5030 T5321Fun T8095 T9020 T9630 T9872b T9872b_defer T9872d TcPlugin_RewritePerf Metric Increase: T15703 T1969 - - - - - 13 changed files: - compiler/GHC/Core/Coercion.hs - compiler/GHC/Core/Coercion/Opt.hs - compiler/GHC/Core/Opt/Pipeline.hs - compiler/GHC/Core/Opt/Simplify/Env.hs - compiler/GHC/Core/Opt/Simplify/Iteration.hs - compiler/GHC/Core/Rules.hs - compiler/GHC/Driver/Config.hs - compiler/GHC/Driver/Config/Core/Opt/Simplify.hs - compiler/GHC/Driver/DynFlags.hs - compiler/GHC/Driver/Session.hs - testsuite/tests/count-deps/CountDepsAst.stdout - testsuite/tests/count-deps/CountDepsParser.stdout - testsuite/tests/simplCore/should_compile/T8331.stderr Changes: ===================================== compiler/GHC/Core/Coercion.hs ===================================== @@ -2041,7 +2041,7 @@ This follows the lifting context extension definition in the -- ---------------------------------------------------- data LiftingContext = LC Subst LiftCoEnv - -- in optCoercion, we need to lift when optimizing InstCo. + -- In optCoercion, we need to lift when optimizing InstCo. -- See Note [Optimising InstCo] in GHC.Core.Coercion.Opt -- We thus propagate the substitution from GHC.Core.Coercion.Opt here. ===================================== compiler/GHC/Core/Coercion/Opt.hs ===================================== @@ -1,10 +1,7 @@ -- (c) The University of Glasgow 2006 {-# LANGUAGE CPP #-} -module GHC.Core.Coercion.Opt - ( optCoProgram, optCoercion - , OptCoercionOpts (..) - ) +module GHC.Core.Coercion.Opt( optCoProgram ) where import GHC.Prelude @@ -44,19 +41,25 @@ import Control.Monad ( zipWithM ) Note [Coercion optimisation] ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -This module does coercion optimisation. See the paper +This module does coercion optimisation. The purpose is to reduce the size +of the coercions that the compiler carries around -- they are just proofs, +and serve no runtime need. So the purpose of coercion optimisation is simply +to shrink coercions and thereby reduce compile time. + +See the paper Evidence normalization in Systtem FV (RTA'13) https://simon.peytonjones.org/evidence-normalization/ The paper is also in the GHC repo, in docs/opt-coercion. -However, although powerful and occasionally very effective, coercion optimisation -can be very expensive (#26679). So we apply it sparingly: +However, although powerful and occasionally very effective, coercion +optimisation can itself be very expensive (#26679). So we apply it sparingly: * In the Simplifier, function `rebuild_go`, we use `isReflexiveCo` (which computes the type of the coercion) to eliminate reflexive coercion, just before we build a cast (e |> co). - (More precisely, we use `isReflexiveCoIgnoringMultiplicity.) + (More precisely, we use `isReflexiveCoIgnoringMultiplicity; + c.f. GHC.Core.Coercion.Opt.opt_univ.) * We have a whole pass, `optCoProgram` that runs the coercion optimiser on all the coercions in the program. @@ -66,6 +69,7 @@ can be very expensive (#26679). So we apply it sparingly: - We run it early in the optimisation pipeline (see GHC.Core.Opt.Pipeline.getCoreToDo). + Controlled by a flag `-fopt-coercion`, on by default Note [Optimising coercion optimisation] @@ -218,7 +222,7 @@ optCoExpr is (Case e b ty alts) = Case (optCoExpr is e) b ty (map (optCoAlt (is `extendInScopeSet` b)) alts) optCo :: InScopeSet -> Coercion -> Coercion -optCo is co = optCoercion' (mkEmptySubst is) co +optCo is co = optCoercion (mkEmptySubst is) co optCoAlt :: InScopeSet -> CoreAlt -> CoreAlt optCoAlt is (Alt k bs e) @@ -231,35 +235,13 @@ optCoAlt is (Alt k bs e) %* * %********************************************************************* -} --- | Coercion optimisation options -newtype OptCoercionOpts = OptCoercionOpts - { optCoercionEnabled :: Bool -- ^ Enable coercion optimisation (reduce its size) - } - -optCoercion :: OptCoercionOpts -> Subst -> Coercion -> NormalCo +optCoercion :: Subst -> Coercion -> NormalCo -- ^ optCoercion applies a substitution to a coercion, -- *and* optimises it to reduce its size -optCoercion opts env co --- Experiment with no optCoercion at all - | optCoercionEnabled opts - = if False then optCoercion' env co - else substCo env co - -{- - = pprTrace "optCoercion {" (text "Co:" <> ppr co) $ - let result = optCoercion' env co in - pprTrace "optCoercion }" - (vcat [ text "Co:" <+> ppr (coercionSize co) - , text "Optco:" <+> ppWhen (isReflCo result) (text "(refl)") - <+> ppr result ]) $ - result --} - - | otherwise - = substCo env co - -optCoercion' :: Subst -> Coercion -> NormalCo -optCoercion' env co +-- The substitution is a vestige of an earlier era, when the coercion optimiser +-- was called by the Simplifier; now it is always empty +-- But I have not removed it in case we ever want it back. +optCoercion env co | debugIsOn = let out_co = opt_co1 lc NotSwapped co (Pair in_ty1 in_ty2, in_role) = coercionKindRole co ===================================== compiler/GHC/Core/Opt/Pipeline.hs ===================================== @@ -224,10 +224,12 @@ getCoreToDo dflags hpt_rule_base extra_vars CoreDoPasses [ simpl_gently , runWhen do_specialise CoreDoSpecialising ], - -- Optimise coercions + -- Optimise coercions: see Note [Coercion optimisation] + -- in GHC.Core.Coercion.Opt -- With -O do this after one run of the Simplifier. -- Without -O, just take what the desugarer produced - -- See Note [Coercion optimisation] in GHC.Core.Coercion.Opt + -- I tried running it right after desugaring, regardless of -O, + -- but that was worse (longer compile times). runWhen do_co_opt CoreOptCoercion, if full_laziness then ===================================== compiler/GHC/Core/Opt/Simplify/Env.hs ===================================== @@ -15,7 +15,7 @@ module GHC.Core.Opt.Simplify.Env ( SimplPhase(..), isActive, seArityOpts, seCaseCase, seCaseFolding, seCaseMerge, seCastSwizzle, seDoEtaReduction, seEtaExpand, seFloatEnable, seInline, seNames, - seOptCoercionOpts, sePhase, sePlatform, sePreInline, + sePhase, sePlatform, sePreInline, seRuleOpts, seRules, seUnfoldingOpts, mkSimplEnv, extendIdSubst, extendCvIdSubst, extendTvSubst, extendCvSubst, @@ -54,7 +54,6 @@ module GHC.Core.Opt.Simplify.Env ( import GHC.Prelude -import GHC.Core.Coercion.Opt ( OptCoercionOpts ) import GHC.Core.FamInstEnv ( FamInstEnv ) import GHC.Core.Opt.Arity ( ArityOpts(..) ) import GHC.Core.Opt.Simplify.Monad @@ -250,9 +249,6 @@ seInline env = sm_inline (seMode env) seNames :: SimplEnv -> [String] seNames env = sm_names (seMode env) -seOptCoercionOpts :: SimplEnv -> OptCoercionOpts -seOptCoercionOpts env = sm_co_opt_opts (seMode env) - sePhase :: SimplEnv -> SimplPhase sePhase env = sm_phase (seMode env) @@ -288,7 +284,6 @@ data SimplMode = SimplMode -- See comments in GHC.Core.Opt.Simplify.Monad , sm_rule_opts :: !RuleOpts , sm_case_folding :: !Bool , sm_case_merge :: !Bool - , sm_co_opt_opts :: !OptCoercionOpts -- ^ Coercion optimiser options } -- | See Note [SimplPhase] ===================================== compiler/GHC/Core/Opt/Simplify/Iteration.hs ===================================== @@ -1531,8 +1531,10 @@ rebuild_go env expr cont TickIt t cont -> rebuild_go env (mkTick t expr) cont CastIt { sc_co = co, sc_cont = cont } | isReflexiveCoIgnoringMultiplicity co - -- ignoring multiplicity: c.f. GHC.Core.Coercion.Opt.opt_univ + -- isReflexiveCo: see Note [Coercion optimisation] + -- in GHc.Core.Coercion.Opt -> rebuild_go env expr cont + | otherwise -> rebuild_go env (mkCast expr co) cont -- NB: mkCast implements the (Coercion co |> g) optimisation ===================================== compiler/GHC/Core/Rules.hs ===================================== @@ -852,17 +852,17 @@ bound on the LHS: Now, if that binding is inlined, so that a=b=Int, we'd get RULE forall (c :: Int~Int). f (x |> c) = e and now when we simplify the LHS (GHC.Core.Opt.Simplify.Iteration.simplRules), - optCoercion (look at the CoVarCo case) will turn that 'c' into Refl: + the Simplifier will turn that 'c' into Refl: RULE forall (c :: Int~Int). f (x |> <Int>) = e and then perhaps drop it altogether. Now 'c' is unbound. + (See the use of isReflexiveCo in GHC.Core.Opt.Simplify.Iteration.) - It's tricky to be sure this never happens, so instead I - say it's OK to have an unbound coercion binder in a RULE - provided its type is (c :: t~t). Then, when the RULE - fires we can substitute <t> for c. + It's tricky to be sure this never happens, so instead I say it's OK + to have an unbound coercion binder in a RULE provided its type is (c + :: t~t). Then, when the RULE fires we can substitute <t> for c. - This actually happened (in a RULE for a local function) - in #13410, and also in test T10602. + This actually happened (in a RULE for a local function) in #13410, + and also in test T10602. Note [Cloning the template binders] ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ===================================== compiler/GHC/Driver/Config.hs ===================================== @@ -1,7 +1,6 @@ -- | Subsystem configuration module GHC.Driver.Config - ( initOptCoercionOpts - , initSimpleOpts + ( initSimpleOpts , initEvalOpts , EvalStep(..) ) @@ -11,15 +10,8 @@ import GHC.Prelude import GHC.Driver.DynFlags import GHC.Core.SimpleOpt -import GHC.Core.Coercion.Opt import GHCi.Message (EvalOpts(..)) --- | Initialise coercion optimiser configuration from DynFlags -initOptCoercionOpts :: DynFlags -> OptCoercionOpts -initOptCoercionOpts dflags = OptCoercionOpts - { optCoercionEnabled = gopt Opt_OptCoercion dflags - } - -- | Initialise Simple optimiser configuration from DynFlags initSimpleOpts :: DynFlags -> SimpleOpts initSimpleOpts dflags = SimpleOpts ===================================== compiler/GHC/Driver/Config/Core/Opt/Simplify.hs ===================================== @@ -13,7 +13,6 @@ import GHC.Core.Opt.Simplify ( SimplifyExprOpts(..), SimplifyOpts(..) ) import GHC.Core.Opt.Simplify.Env ( FloatEnable(..), SimplMode(..), SimplPhase(..) ) import GHC.Core.Opt.Simplify.Monad ( TopEnvConfig(..) ) -import GHC.Driver.Config ( initOptCoercionOpts ) import GHC.Driver.Config.Core.Lint ( initLintPassResultConfig ) import GHC.Driver.Config.Core.Rules ( initRuleOpts ) import GHC.Driver.Config.Core.Opt.Arity ( initArityOpts ) @@ -73,7 +72,6 @@ initSimplMode dflags phase name = SimplMode , sm_rule_opts = initRuleOpts dflags , sm_case_folding = gopt Opt_CaseFolding dflags , sm_case_merge = gopt Opt_CaseMerge dflags - , sm_co_opt_opts = initOptCoercionOpts dflags } initGentleSimplMode :: DynFlags -> SimplMode ===================================== compiler/GHC/Driver/DynFlags.hs ===================================== @@ -6,7 +6,7 @@ module GHC.Driver.DynFlags ( Language(..), FatalMessager, FlushOut(..), ProfAuto(..), - hasPprDebug, hasNoDebugOutput, hasNoStateHack, hasNoOptCoercion, + hasPprDebug, hasNoDebugOutput, hasNoStateHack, dopt, dopt_set, dopt_unset, gopt, gopt_set, gopt_unset, wopt, wopt_set, wopt_unset, @@ -994,9 +994,6 @@ hasNoDebugOutput = dopt Opt_D_no_debug_output hasNoStateHack :: DynFlags -> Bool hasNoStateHack = gopt Opt_G_NoStateHack -hasNoOptCoercion :: DynFlags -> Bool -hasNoOptCoercion flags = not (gopt Opt_OptCoercion flags) - -- | Test whether a 'DumpFlag' is set dopt :: DumpFlag -> DynFlags -> Bool dopt = getDumpFlagFrom verbosity dumpFlags ===================================== compiler/GHC/Driver/Session.hs ===================================== @@ -22,7 +22,7 @@ module GHC.Driver.Session ( FatalMessager, FlushOut(..), ProfAuto(..), glasgowExtsFlags, - hasPprDebug, hasNoDebugOutput, hasNoStateHack, hasNoOptCoercion, + hasPprDebug, hasNoDebugOutput, hasNoStateHack, dopt, dopt_set, dopt_unset, gopt, gopt_set, gopt_unset, setGeneralFlag', unSetGeneralFlag', wopt, wopt_set, wopt_unset, ===================================== testsuite/tests/count-deps/CountDepsAst.stdout ===================================== @@ -14,7 +14,6 @@ GHC.Core GHC.Core.Class GHC.Core.Coercion GHC.Core.Coercion.Axiom -GHC.Core.Coercion.Opt GHC.Core.ConLike GHC.Core.DataCon GHC.Core.FVs ===================================== testsuite/tests/count-deps/CountDepsParser.stdout ===================================== @@ -14,7 +14,6 @@ GHC.Core GHC.Core.Class GHC.Core.Coercion GHC.Core.Coercion.Axiom -GHC.Core.Coercion.Opt GHC.Core.ConLike GHC.Core.DataCon GHC.Core.FVs ===================================== testsuite/tests/simplCore/should_compile/T8331.stderr ===================================== @@ -20,9 +20,9 @@ = ($fApplicativeReaderT6 @s @r) `cast` (forall (a ::~ <*>_N) (b ::~ <*>_N). <a>_R - ->_R <ReaderT r (ST s) b>_R - ->_R <r>_R ->_R Sym (N:ST <s>_N <a>_R) - ; Sym (N:ReaderT <*>_N <r>_R <ST s>_R <a>_N) + ->_R <ReaderT r (ST s) b>_R ->_R <r>_R ->_R Sym (N:ST <s>_N <a>_R) + ; (<ReaderT r (ST s) b>_R + ->_R Sym (N:ReaderT <*>_N <r>_R <ST s>_R <a>_N)) :: Coercible (forall a b. a -> ReaderT r (ST s) b -> r -> STRep s a) (forall a b. a -> ReaderT r (ST s) b -> ReaderT r (ST s) a)) @@ -32,9 +32,9 @@ = ($fApplicativeReaderT1 @s @r) `cast` (forall (a ::~ <*>_N) (b ::~ <*>_N). <ReaderT r (ST s) a>_R - ->_R <ReaderT r (ST s) b>_R - ->_R <r>_R ->_R Sym (N:ST <s>_N <a>_R) - ; Sym (N:ReaderT <*>_N <r>_R <ST s>_R <a>_N) + ->_R <ReaderT r (ST s) b>_R ->_R <r>_R ->_R Sym (N:ST <s>_N <a>_R) + ; (<ReaderT r (ST s) b>_R + ->_R Sym (N:ReaderT <*>_N <r>_R <ST s>_R <a>_N)) :: Coercible (forall a b. ReaderT r (ST s) a -> ReaderT r (ST s) b -> r -> STRep s a) @@ -78,9 +78,9 @@ = ($fApplicativeReaderT7 @s @r) `cast` (forall (a ::~ <*>_N) (b ::~ <*>_N). <a -> b>_R - ->_R <ReaderT r (ST s) a>_R - ->_R <r>_R ->_R Sym (N:ST <s>_N <b>_R) - ; Sym (N:ReaderT <*>_N <r>_R <ST s>_R <b>_N) + ->_R <ReaderT r (ST s) a>_R ->_R <r>_R ->_R Sym (N:ST <s>_N <b>_R) + ; (<ReaderT r (ST s) a>_R + ->_R Sym (N:ReaderT <*>_N <r>_R <ST s>_R <b>_N)) :: Coercible (forall a b. (a -> b) -> ReaderT r (ST s) a -> r -> STRep s b) (forall a b. (a -> b) -> ReaderT r (ST s) a -> ReaderT r (ST s) b)) @@ -91,9 +91,9 @@ `cast` (forall (a ::~ <*>_N) (b ::~ <*>_N) (c ::~ <*>_N). <a -> b -> c>_R ->_R <ReaderT r (ST s) a>_R - ->_R <ReaderT r (ST s) b>_R - ->_R <r>_R ->_R Sym (N:ST <s>_N <c>_R) - ; Sym (N:ReaderT <*>_N <r>_R <ST s>_R <c>_N) + ->_R <ReaderT r (ST s) b>_R ->_R <r>_R ->_R Sym (N:ST <s>_N <c>_R) + ; (<ReaderT r (ST s) b>_R + ->_R Sym (N:ReaderT <*>_N <r>_R <ST s>_R <c>_N)) :: Coercible (forall a b c. (a -> b -> c) @@ -114,9 +114,9 @@ $fApplicativeReaderT_$cpure @(ST s) @r $dApplicative = ($fApplicativeReaderT5 @s @r) `cast` (forall (a ::~ <*>_N). - <a>_R - ->_R <r>_R ->_R Sym (N:ST <s>_N <a>_R) - ; Sym (N:ReaderT <*>_N <r>_R <ST s>_R <a>_N) + Sym (<a>_R + ->_R N:ReaderT <*>_N <r>_R <ST s>_R <a>_N + ; (<r>_R ->_R N:ST <s>_N <a>_R)) :: Coercible (forall a. a -> r -> STRep s a) (forall a. a -> ReaderT r (ST s) a)) @@ -125,9 +125,9 @@ $fMonadReaderT_$creturn @(ST s) @r $dMonad = ($fApplicativeReaderT5 @s @r) `cast` (forall (a ::~ <*>_N). - <a>_R - ->_R <r>_R ->_R Sym (N:ST <s>_N <a>_R) - ; Sym (N:ReaderT <*>_N <r>_R <ST s>_R <a>_N) + Sym (<a>_R + ->_R N:ReaderT <*>_N <r>_R <ST s>_R <a>_N + ; (<r>_R ->_R N:ST <s>_N <a>_R)) :: Coercible (forall a. a -> r -> STRep s a) (forall a. a -> ReaderT r (ST s) a)) @@ -148,9 +148,9 @@ ($dMonadAbstractIOST :: MonadAbstractIOST (ReaderT Int (ST s))). useAbstractMonad @(ReaderT Int (ST s)) $dMonadAbstractIOST = (useAbstractMonad1 @s) - `cast` (<Int>_R - ->_R <Int>_R ->_R Sym (N:ST <s>_N <Int>_R) - ; Sym (N:ReaderT <*>_N <Int>_R <ST s>_R <Int>_N) + `cast` (Sym (<Int>_R + ->_R N:ReaderT <*>_N <Int>_R <ST s>_R <Int>_N + ; (<Int>_R ->_R N:ST <s>_N <Int>_R)) :: Coercible (Int -> Int -> STRep s Int) (Int -> ReaderT Int (ST s) Int)) View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/b8ca7215aa80669fe2d93109dc7b37a… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/b8ca7215aa80669fe2d93109dc7b37a… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc] Pushed new branch wip/c-o3
by Cheng Shao (＠TerrorJack) 01 Jan '26

01 Jan '26

Cheng Shao pushed new branch wip/c-o3 at Glasgow Haskell Compiler / GHC -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/tree/wip/c-o3 You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc] Pushed new branch wip/26699
by recursion-ninja (＠recursion-ninja) 01 Jan '26

01 Jan '26

recursion-ninja pushed new branch wip/26699 at Glasgow Haskell Compiler / GHC -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/tree/wip/26699 You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/romes/hadrian-cross-stage2-rebase_SVEN_FINAL] Mark T24602 as fragile
by Sven Tennie (＠supersven) 01 Jan '26

01 Jan '26

Sven Tennie pushed to branch wip/romes/hadrian-cross-stage2-rebase_SVEN_FINAL at Glasgow Haskell Compiler / GHC Commits: 770b5b52 by Sven Tennie at 2026-01-01T12:15:07+01:00 Mark T24602 as fragile It was skipped before (due to CROSS_EMULATOR being set, which changed for JS), so we don't make things worse by marking it as fragile. - - - - - 1 changed file: - testsuite/tests/javascript/closure/all.T Changes: ===================================== testsuite/tests/javascript/closure/all.T ===================================== @@ -1,4 +1,11 @@ # These are JavaScript-specific tests based on Google Closure Compiler setTestOpts(when(not(js_arch()),skip)) -test('T24602', normal, makefile_test, ['T24602']) +# Runs fine locally. Fails on CI with: +# +# Wrong exit code for T24602()(expected 0 , actual 2 ) +# Stderr run ( T24602 ): +# gmake: node: Permission denied +# gmake: *** [Makefile:11: T24602] Error 127 +# *** unexpected failure for T24602(normal) +test('T24602', fragile(26712), makefile_test, ['T24602']) View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/770b5b52925c8111b2cdf5371b400b8… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/770b5b52925c8111b2cdf5371b400b8… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/romes/hadrian-cross-stage2-rebase_SVEN_FINAL] Mark T24602 as fragile
by Sven Tennie (＠supersven) 01 Jan '26

01 Jan '26

Sven Tennie pushed to branch wip/romes/hadrian-cross-stage2-rebase_SVEN_FINAL at Glasgow Haskell Compiler / GHC Commits: e7a6734f by GHC GitLab CI at 2026-01-01T10:26:59+01:00 Mark T24602 as fragile It was skipped before (due to CROSS_EMULATOR being set, which changed for JS), so we don't make things worse by marking it as fragile. - - - - - 1 changed file: - testsuite/tests/javascript/closure/all.T Changes: ===================================== testsuite/tests/javascript/closure/all.T ===================================== @@ -1,4 +1,11 @@ # These are JavaScript-specific tests based on Google Closure Compiler setTestOpts(when(not(js_arch()),skip)) -test('T24602', normal, makefile_test, ['T24602']) +# Runs fine locally. Fails on CI with: +# +# Wrong exit code for T24602()(expected 0 , actual 2 ) +# Stderr run ( T24602 ): +# gmake: node: Permission denied +# gmake: *** [Makefile:11: T24602] Error 127 +# *** unexpected failure for T24602(normal) +test('T24602', fragile(26712), makefile_test, ['T24602']) View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/e7a6734f10543809a1a82bfbfe3bd86… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/e7a6734f10543809a1a82bfbfe3bd86… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc] Pushed new branch wip/ghc-9.12-fix-div
by Cheng Shao (＠TerrorJack) 01 Jan '26

01 Jan '26

Cheng Shao pushed new branch wip/ghc-9.12-fix-div at Glasgow Haskell Compiler / GHC -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/tree/wip/ghc-9.12-fix-div You're receiving this email because of your account on gitlab.haskell.org.

1 0