- ghc-commits - Haskell.org

[Git][ghc/ghc][master] 7 commits: Add regression test for #12694
by Marge Bot (＠marge-bot) 11 Mar '26

11 Mar '26

Marge Bot pushed to branch master at Glasgow Haskell Compiler / GHC Commits: e7054934 by Simon Jakobi at 2026-03-11T15:05:16-04:00 Add regression test for #12694 Closes #12694. - - - - - 4756d9f6 by Simon Jakobi at 2026-03-11T15:05:16-04:00 Add regression test for #16275 Closes #16275. - - - - - 34b7e2c1 by Simon Jakobi at 2026-03-11T15:05:16-04:00 Add regression test for #14908 Closes #14908. - - - - - 4243db3d by Simon Jakobi at 2026-03-11T15:05:16-04:00 Add regression test for #14151 Closes #14151. - - - - - 0e9f1453 by Simon Jakobi at 2026-03-11T15:05:16-04:00 Add regression test for #12640 Closes #12640. - - - - - ae606c7f by Simon Jakobi at 2026-03-11T15:05:16-04:00 Add regression test for #15588 Closes #15588. - - - - - 5a38ce4e by Simon Jakobi at 2026-03-11T15:05:16-04:00 Add regression test for #9445 Closes #9445. - - - - - 18 changed files: - + testsuite/tests/dependent/should_fail/T15588.hs - + testsuite/tests/dependent/should_fail/T15588.stderr - testsuite/tests/dependent/should_fail/all.T - + testsuite/tests/simplCore/should_compile/T12640.hs - + testsuite/tests/simplCore/should_compile/T12640.stderr - + testsuite/tests/simplCore/should_compile/T14908.hs - + testsuite/tests/simplCore/should_compile/T14908_Deps.hs - + testsuite/tests/simplCore/should_compile/T9445.hs - testsuite/tests/simplCore/should_compile/all.T - + testsuite/tests/typecheck/should_compile/T14151.hs - testsuite/tests/typecheck/should_compile/all.T - + testsuite/tests/typecheck/should_fail/T12694.hs - + testsuite/tests/typecheck/should_fail/T12694.stderr - + testsuite/tests/typecheck/should_fail/T16275.stderr - + testsuite/tests/typecheck/should_fail/T16275A.hs - + testsuite/tests/typecheck/should_fail/T16275B.hs - + testsuite/tests/typecheck/should_fail/T16275B.hs-boot - testsuite/tests/typecheck/should_fail/all.T Changes: ===================================== testsuite/tests/dependent/should_fail/T15588.hs ===================================== @@ -0,0 +1,25 @@ +{- This program used to cause a panic (#15588), but it should possibly even be +accepted. See #15589. -} +{-# LANGUAGE AllowAmbiguousTypes #-} +{-# LANGUAGE DataKinds #-} +{-# LANGUAGE PolyKinds #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# LANGUAGE TypeFamilies #-} +{-# LANGUAGE TypeOperators #-} +module T15588 where + +import Data.Proxy +import Data.Type.Equality +import Data.Type.Bool +import Data.Kind + +data SameKind :: forall k. k -> k -> Type +type family IfK (e :: Proxy (j :: Bool)) (f :: m) (g :: n) :: If j m n where + IfK (_ :: Proxy True) f _ = f + IfK (_ :: Proxy False) _ g = g + +y :: forall ck (c :: ck). ck :~: Proxy True -> () +y Refl = let x :: forall a b (d :: a). SameKind (IfK c b d) d + x = undefined + in () + ===================================== testsuite/tests/dependent/should_fail/T15588.stderr ===================================== @@ -0,0 +1,7 @@ +T15588.hs:18:9: error: [GHC-25897] + • Couldn't match kind ‘j’ with ‘True’ + Expected kind ‘Proxy j’, + but ‘_ :: Proxy True’ has kind ‘Proxy True’ + • In the first argument of ‘IfK’, namely ‘(_ :: Proxy True)’ + In the type family declaration for ‘IfK’ + ===================================== testsuite/tests/dependent/should_fail/all.T ===================================== @@ -34,6 +34,7 @@ test('T15215', normal, compile_fail, ['']) test('T15308', normal, compile_fail, ['-fno-print-explicit-kinds']) test('T15343', normal, compile_fail, ['']) test('T15380', normal, compile_fail, ['']) +test('T15588', normal, compile_fail, ['']) test('T15591b', normal, compile_fail, ['']) test('T15591c', normal, compile_fail, ['']) test('T15743c', normal, compile_fail, ['']) ===================================== testsuite/tests/simplCore/should_compile/T12640.hs ===================================== @@ -0,0 +1,18 @@ +{-# LANGUAGE MultiParamTypeClasses, FunctionalDependencies #-} +module T12640 where + +class Ex2 a b c | a b -> c where + (+++) :: a -> b -> c + +instance Ex2 Bool Bool Bool where + (+++) = ex_or + +{-# INLINE [2] ex_or #-} +ex_or = (||) + +{-# RULES +"force-inline" forall a b . ex_or a b = a || b + #-} + +main = print (True +++ True) + ===================================== testsuite/tests/simplCore/should_compile/T12640.stderr ===================================== @@ -0,0 +1,2 @@ +Rule fired: Class op show (BUILTIN) +Rule fired: force-inline (T12640) ===================================== testsuite/tests/simplCore/should_compile/T14908.hs ===================================== @@ -0,0 +1,58 @@ +{-# LANGUAGE OverloadedStrings, LambdaCase #-} +import Data.String +import T14908_Deps +import Data.List (nub, sort) +import System.Environment + +data Expr = Var String | Not Expr | Expr :|: Expr | Expr :&: Expr deriving Eq + +nfd e = if e == e' then e else nfd e' + where e' = rec e + rec x@(Var _) = x + rec x@(Not (Var _)) = x + rec (Not (Not x)) = x + rec (Not (a :|: b)) = rec $ Not a :&: Not b + rec (Not (a :&: b)) = rec $ Not a :|: Not b + rec ((a :|: b) :&: c) = rec $ (a :&: c) :|: (b :&: c) + rec (a :&: (b :|: c)) = rec $ (a :&: b) :|: (a :&: c) + rec (a :&: b) = rec a :&: rec b + rec (a :|: b) = rec a :|: rec b + +eval :: Expr -> Reader [(String, Bool)] Bool +eval (Var x) = asks (lookup x) >>= maybe (error $ "Var `" ++ x ++ "` not defined!") return +eval (Not x) = not <$> eval x +eval (a :&: b) = (&&) <$> eval a <*> eval b +eval (a :|: b) = (||) <$> eval a <*> eval b + +instance Show Expr where + show (Var x) = x + show (Not (Var x)) = "¬" ++ x + show (Not x) = "¬(" ++ show x ++ ")" + show (a :|: b) = show' a ++ " ∨ " ++ show' b where show' c@(_ :&: _) = "(" ++ show c ++ ")"; show' c = show c + show (a :&: b) = show' a ++ " ∧ " ++ show' b where show' c@(_ :|: _) = "(" ++ show c ++ ")"; show' c = show c + +instance IsString Expr where + fromString = Var + +fullImage e = (runReader (eval e) . zipWith (,) vs) <$> bits (length vs) + where vs = nub $ sort $ vars e + vars (Var x) = [x] + vars (Not x) = vars x + vars (a :&: b) = vars a ++ vars b + vars (a :|: b) = vars a ++ vars b + bits 0 = [[]] + bits n = ((False:) <$> xs) ++ ((True:) <$> xs) where xs = bits (n - 1) + +testNFD e = fullImage e == fullImage (nfd e) + +instance Arbitrary Expr where + arbitrary = sized gen + where gen n = choose (1, max 1 (min 4 n)) >>= \case + 1 -> (Var . (:"") . (['a'..]!!)) <$> choose (1, 5) -- no más de 5 vars + 2 -> (:&:) <$> gen (n-1) <*> gen (n-1) + 3 -> (:|:) <$> gen (n-1) <*> gen (n-1) + 4 -> Not <$> gen (n-1) + +main = do + [a,b] <- map (read :: String -> Int) <$> getArgs + quickCheckWith (stdArgs {maxSize = fromIntegral 10, maxSuccess = fromIntegral 1000}) testNFD ===================================== testsuite/tests/simplCore/should_compile/T14908_Deps.hs ===================================== @@ -0,0 +1,100 @@ +module T14908_Deps + ( Reader + , runReader + , asks + , Arbitrary(..) + , Gen + , sized + , choose + , Args(..) + , stdArgs + , quickCheckWith + ) where + +import System.CPUTime (getCPUTime) + +newtype Reader r a = Reader { runReader :: r -> a } + +instance Functor (Reader r) where + fmap f (Reader g) = Reader (f . g) + +instance Applicative (Reader r) where + pure x = Reader (\_ -> x) + Reader f <*> Reader g = Reader (\r -> f r (g r)) + +instance Monad (Reader r) where + return = pure + Reader g >>= f = Reader (\r -> runReader (f (g r)) r) + +asks :: (r -> a) -> Reader r a +asks f = Reader f + +newtype Gen a = Gen { runGen :: Int -> Int -> (a, Int) } + +instance Functor Gen where + fmap f (Gen g) = Gen $ \n s -> + let (x, s') = g n s + in (f x, s') + +instance Applicative Gen where + pure x = Gen (\_ s -> (x, s)) + Gen f <*> Gen g = Gen $ \n s -> + let (h, s1) = f n s + (x, s2) = g n s1 + in (h x, s2) + +instance Monad Gen where + return = pure + Gen g >>= f = Gen $ \n s -> + let (x, s1) = g n s + in runGen (f x) n s1 + +class Arbitrary a where + arbitrary :: Gen a + +sized :: (Int -> Gen a) -> Gen a +sized f = Gen $ \n s -> runGen (f n) n s + +choose :: (Int, Int) -> Gen Int +choose (lo, hi) = Gen $ \_ s -> + let s' = nextSeed s + width = hi - lo + 1 + offset = if width <= 0 then 0 else abs s' `mod` width + in (lo + offset, s') + +data Args = Args + { maxSize :: Int + , maxSuccess :: Int + } + +stdArgs :: Args +stdArgs = Args + { maxSize = 100 + , maxSuccess = 100 + } + +quickCheckWith :: (Arbitrary a, Show a) => Args -> (a -> Bool) -> IO () +quickCheckWith args prop = do + seed0 <- seedFromCPUTime + loop 0 seed0 + where + total = max 0 (maxSuccess args) + maxN = max 1 (maxSize args) + + loop n seed + | n >= total = putStrLn ("+++ OK, passed " ++ show total ++ " tests.") + | otherwise = + let size = (n `mod` maxN) + 1 + (x, seed') = runGen arbitrary size seed + in if prop x + then loop (n + 1) seed' + else putStrLn ("*** Failed! Falsified with input: " ++ show x) + +seedFromCPUTime :: IO Int +seedFromCPUTime = do + t <- getCPUTime + return (fromInteger (t `mod` 2147483647)) + +nextSeed :: Int -> Int +nextSeed x = + fromInteger ((1103515245 * toInteger x + 12345) `mod` 2147483647) ===================================== testsuite/tests/simplCore/should_compile/T9445.hs ===================================== @@ -0,0 +1,13 @@ +module T9445 (Transform) where + +data Transform = Transform + { m00 :: !Float, m10 :: !Float, m20 :: !Float + , m01 :: !Float, m11 :: !Float, m21 :: !Float + , m02 :: !Float, m12 :: !Float, m22 :: !Float + } + +instance Num Transform where + abs (Transform a00 a01 a02 a03 a04 a05 a06 a07 a08) = + (Transform (abs a00) (abs a01) (abs a02) (abs a03) + (abs a04) (abs a05) (abs a06) (abs a07) (abs a08)) + ===================================== testsuite/tests/simplCore/should_compile/all.T ===================================== @@ -190,6 +190,7 @@ test('T9400', only_ways(['optasm']), compile, ['-O0 -ddump-simpl -dsuppress-uniq test('T9441a', [only_ways(['optasm']), check_errmsg(r'f1 = f2') ], compile, ['-ddump-simpl -dsuppress-ticks']) test('T9441b', [only_ways(['optasm']), check_errmsg(r'Rec {') ], compile, ['-ddump-simpl']) test('T9441c', [only_ways(['optasm']), check_errmsg(r'Rec {') ], compile, ['-ddump-simpl']) +test('T9445', only_ways(['optasm']), compile, ['-Wno-missing-methods']) test('T9583', only_ways(['optasm']), compile, ['']) test('T9565', only_ways(['optasm']), compile, ['']) test('T5821', only_ways(['optasm']), compile, ['']) @@ -227,6 +228,7 @@ test('T9509', test('T12603', normal, makefile_test, ['T12603']) +test('T12640', [grep_errmsg(r'force-inline')], compile, ['-O2 -ddump-rule-firings']) test('T12877', normal, makefile_test, ['T12877']) test('T13027', normal, compile, ['']) test('T13025', @@ -279,6 +281,7 @@ test('T14152a', [extra_files(['T14152.hs']), pre_cmd('cp T14152.hs T14152a.hs'), compile, ['-fno-exitification -ddump-simpl']) test('T13990', normal, compile, ['-dcore-lint -O']) test('T14650', normal, compile, ['-O2']) +test('T14908', normal, multimod_compile, ['T14908', '-O2 -v0']) test('T14959', normal, compile, ['-O']) test('T14978', normal, ===================================== testsuite/tests/typecheck/should_compile/T14151.hs ===================================== @@ -0,0 +1,20 @@ +{-# LANGUAGE DataKinds #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE KindSignatures #-} +{-# LANGUAGE PolyKinds #-} +{-# LANGUAGE RankNTypes #-} +module T14151 where + +newtype HFix h a = HFix (h (HFix h) a) + +class EqForall f where + eqForall :: f a -> f a -> Bool + +class EqHetero h where + eqHetero :: (forall x. f x -> f x -> Bool) -> h f a -> h f a -> Bool + +instance EqHetero h => EqForall (HFix h) where + eqForall (HFix a) (HFix b) = eqHetero eqForall a b + +instance EqHetero h => Eq (HFix h a) where + (==) = eqForall ===================================== testsuite/tests/typecheck/should_compile/all.T ===================================== @@ -601,6 +601,7 @@ test('T13915b', expect_broken(15245), compile, ['']) test('T13984', normal, compile, ['']) test('T14128', normal, multimod_compile, ['T14128Main', '-v0']) test('T14149', normal, compile_fail, ['']) +test('T14151', normal, compile, ['']) test('T14154', normal, compile, ['']) test('T14158', normal, compile, ['']) test('T13943', normal, compile, ['-fsolve-constant-dicts']) ===================================== testsuite/tests/typecheck/should_fail/T12694.hs ===================================== @@ -0,0 +1,5 @@ +{-# LANGUAGE GADTs #-} +module T12694 where + +f :: Bool ~ Int => a -> b +f x = x ===================================== testsuite/tests/typecheck/should_fail/T12694.stderr ===================================== @@ -0,0 +1,20 @@ +T12694.hs:5:7: error: [GHC-25897] + • Could not deduce ‘a ~ b’ + from the context: Bool ~ Int + bound by the type signature for: + f :: forall a b. (Bool ~ Int) => a -> b + at T12694.hs:4:1-25 + ‘a’ is a rigid type variable bound by + the type signature for: + f :: forall a b. (Bool ~ Int) => a -> b + at T12694.hs:4:1-25 + ‘b’ is a rigid type variable bound by + the type signature for: + f :: forall a b. (Bool ~ Int) => a -> b + at T12694.hs:4:1-25 + • In the expression: x + In an equation for ‘f’: f x = x + • Relevant bindings include + x :: a (bound at T12694.hs:5:3) + f :: a -> b (bound at T12694.hs:5:1) + ===================================== testsuite/tests/typecheck/should_fail/T16275.stderr ===================================== @@ -0,0 +1,5 @@ +T16275B.hs-boot:4:10: error: [GHC-65507] + • Wildcard ‘_’ not allowed + • In the first argument of ‘T’, namely ‘_’ + In the type signature: foo :: T _ + ===================================== testsuite/tests/typecheck/should_fail/T16275A.hs ===================================== @@ -0,0 +1,3 @@ +module T16275A where + +import {-# SOURCE #-} T16275B ===================================== testsuite/tests/typecheck/should_fail/T16275B.hs ===================================== @@ -0,0 +1 @@ +module T16275B where ===================================== testsuite/tests/typecheck/should_fail/T16275B.hs-boot ===================================== @@ -0,0 +1,4 @@ +module T16275B where + +data T a +foo :: T _ ===================================== testsuite/tests/typecheck/should_fail/all.T ===================================== @@ -430,6 +430,7 @@ test('T12589', normal, compile_fail, ['']) test('T12529', normal, compile_fail, ['']) test('T12563', normal, compile, ['']) # Turns out we can accept this one after all! test('T12648', normal, compile_fail, ['']) +test('T12694', normal, compile_fail, ['']) test('T12729', normal, compile_fail, ['']) test('T12785b', normal, compile_fail, ['']) test('T12803', normal, compile_fail, ['']) @@ -518,6 +519,8 @@ test('T16059e', [extra_files(['T16059b.hs'])], multimod_compile_fail, ['T16059e', '-v0']) test('T16255', normal, compile_fail, ['']) test('T16204c', normal, compile_fail, ['']) +test('T16275', [extra_files(['T16275A.hs', 'T16275B.hs', 'T16275B.hs-boot'])], + multimod_compile_fail, ['T16275A', '-v0']) test('T16394', normal, compile_fail, ['']) test('T16414', normal, compile_fail, ['']) test('T16453E1', extra_files(['T16453T.hs', 'T16453S.hs']), multimod_compile_fail, View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/d3690ae808d75f63a2f682bb44a7af… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/d3690ae808d75f63a2f682bb44a7af… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][master] User guide: Clarify phase control on INLINEABLE[foo] pragmas.
by Marge Bot (＠marge-bot) 11 Mar '26

11 Mar '26

Marge Bot pushed to branch master at Glasgow Haskell Compiler / GHC Commits: d3690ae8 by Andreas Klebinger at 2026-03-11T15:04:31-04:00 User guide: Clarify phase control on INLINEABLE[foo] pragmas. Fixes #26851 - - - - - 2 changed files: - docs/users_guide/exts/pragmas.rst - docs/users_guide/exts/rewrite_rules.rst Changes: ===================================== docs/users_guide/exts/pragmas.rst ===================================== @@ -570,6 +570,12 @@ optionally specify a phase number, thus: - "``NOINLINE[~k] f``" means: be willing to inline ``f`` until phase ``k``, but from phase ``k`` onwards do not inline it. +- "``INLINEABLE[k] f``" means: do not inline ``f`` until phase ``k``, but + from phase ``k`` onwards GHC is free to inline it. + +- "``INLINEABLE[~k] f``" means: GHC is free to inline ``f`` until phase + ``k``, but from phase ``k`` onwards do not inline it. + The same information is summarised here: .. code-block:: none @@ -579,6 +585,8 @@ The same information is summarised here: {-# INLINE [~2] f #-} -- Yes No {-# NOINLINE [2] f #-} -- No Maybe {-# NOINLINE [~2] f #-} -- Maybe No + {-# INLINEABLE [2] f #-} -- No Maybe + {-# INLINEABLE [~2] f #-} -- Maybe No {-# INLINE f #-} -- Yes Yes {-# NOINLINE f #-} -- No No ===================================== docs/users_guide/exts/rewrite_rules.rst ===================================== @@ -293,6 +293,16 @@ its :pragma:`RULES` have had a chance to fire. The warning flag :ghc-flag:`-Winline-rule-shadowing` (see :ref:`options-sanity`) warns about this situation. +All of this applies similarly to :pragma:`INLINABLE` (also accepted as +``INLINABLE``; see :ref:`inline-noinline-pragma`). As with +the other pragmas, you can use explicit :ref:`phase-control` to delay +inlining so that a :pragma:`RULES` rewrite has an opportunity to match first. + +The key difference from :pragma:`INLINE` (see :ref:`inline-pragma`) is that +:pragma:`INLINABLE` does not guarantee inlining, leaving the inlining decision +to GHC's usual heuristics. Use :pragma:`INLINE` when your RULE setup relies +on inlining happening reliably, and :pragma:`INLINABLE` otherwise. + .. _conlike: How rules interact with ``CONLIKE`` pragmas @@ -528,4 +538,3 @@ Controlling what's going on in rewrite rules see how to write rules that will do fusion and yet give an efficient program even if fusion doesn't happen. More rules in ``GHC/List.hs``. - View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/d3690ae808d75f63a2f682bb44a7af8… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/d3690ae808d75f63a2f682bb44a7af8… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][master] 3 commits: Ensure T14272 is run in optasm way
by Marge Bot (＠marge-bot) 11 Mar '26

11 Mar '26

Marge Bot pushed to branch master at Glasgow Haskell Compiler / GHC Commits: fff362cf by Simon Jakobi at 2026-03-11T15:03:49-04:00 Ensure T14272 is run in optasm way Closes #16539. - - - - - ec81ec2c by Simon Jakobi at 2026-03-11T15:03:49-04:00 Add regression test for #24632 Closes #24632. - - - - - cefec47b by Simon Jakobi at 2026-03-11T15:03:50-04:00 Fix module name of T9675: T6975 -> T9675 - - - - - 6 changed files: - + testsuite/tests/ghci/scripts/T24632.hs - + testsuite/tests/ghci/scripts/T24632.script - + testsuite/tests/ghci/scripts/T24632.stdout - testsuite/tests/ghci/scripts/all.T - testsuite/tests/perf/compiler/T9675.hs - testsuite/tests/simplCore/should_compile/all.T Changes: ===================================== testsuite/tests/ghci/scripts/T24632.hs ===================================== @@ -0,0 +1,22 @@ +{-# LANGUAGE GADTs #-} +{-# LANGUAGE DataKinds #-} + +module T24632 where + +import GHC.TypeLits +import Data.Proxy + +data N (n :: Nat) where + O :: (n ~ 0) => N n + S :: (1 <= n) => N n + +f :: forall n. KnownNat n => (1 <= n => N n) -> N n +f c = case cmpNat @1 @n Proxy Proxy of EQI -> c + +g :: KnownNat n => N n +g = f S + +--x :: N 1 -- With type signature: no issue +x = g @1 + +-- ghci> :force x --> internal error: stg_ap_p_ret ===================================== testsuite/tests/ghci/scripts/T24632.script ===================================== @@ -0,0 +1,2 @@ +:load T24632.hs +seq x () ===================================== testsuite/tests/ghci/scripts/T24632.stdout ===================================== @@ -0,0 +1 @@ +() ===================================== testsuite/tests/ghci/scripts/all.T ===================================== @@ -384,6 +384,7 @@ test('T13869', extra_files(['T13869a.hs', 'T13869b.hs']), ghci_script, ['T13869. test('ListTuplePunsPpr', normal, ghci_script, ['ListTuplePunsPpr.script']) test('ListTuplePunsPprNoAbbrevTuple', [expect_broken(23135), limit_stdout_lines(13)], ghci_script, ['ListTuplePunsPprNoAbbrevTuple.script']) test('T24459', normal, ghci_script, ['T24459.script']) +test('T24632', normal, ghci_script, ['T24632.script']) # Test package renaming in GHCi session test('GhciPackageRename', ===================================== testsuite/tests/perf/compiler/T9675.hs ===================================== @@ -1,4 +1,4 @@ -module T6975 where +module T9675 where data Foo = Foo { field1 :: Int -> Int , field2 :: Int -> Int ===================================== testsuite/tests/simplCore/should_compile/all.T ===================================== @@ -270,7 +270,8 @@ test('T14140', normal, makefile_test, ['T14140']) -test('T14272', normal, compile, ['']) +# T14272 used to cause a compiler heap overflow in optasm: #16539 +test('T14272', only_ways(['optasm']), compile, ['']) test('T14270a', normal, compile, ['']) test('T14152', [ only_ways(['optasm']), check_errmsg(r'dead code') ], compile, ['-ddump-simpl']) test('T14152a', [extra_files(['T14152.hs']), pre_cmd('cp T14152.hs T14152a.hs'), View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/517cf64e88567383017c0307d3c4f3… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/517cf64e88567383017c0307d3c4f3… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][master] Add regression test for #15907
by Marge Bot (＠marge-bot) 11 Mar '26

11 Mar '26

Marge Bot pushed to branch master at Glasgow Haskell Compiler / GHC Commits: 517cf64e by Simon Jakobi at 2026-03-11T15:03:03-04:00 Add regression test for #15907 Closes #15907. - - - - - 3 changed files: - + testsuite/tests/corelint/T15907.hs - + testsuite/tests/corelint/T15907A.hs - testsuite/tests/corelint/all.T Changes: ===================================== testsuite/tests/corelint/T15907.hs ===================================== @@ -0,0 +1,11 @@ +module T15907 where + +import T15907A + +testMemo :: IO () +testMemo = do + let keys = [[1 .. n] | n <- [1 .. 1000]] + keys2 = [[n, n - 1 .. 1] | n <- [1 .. 1000]] + mlength = memo length + putStr (show (map mlength (keys ++ keys ++ keys2 ++ keys2))) + putStr (show (mlength [1 .. 100000])) ===================================== testsuite/tests/corelint/T15907A.hs ===================================== @@ -0,0 +1,92 @@ +module T15907A + ( memo + , memoSized + ) where + +import Control.Concurrent.MVar (MVar, newMVar, putMVar, takeMVar) +import Data.Array.IO (IOArray, newArray, readArray, writeArray) +import System.IO.Unsafe (unsafePerformIO) +import System.Mem.StableName (StableName, hashStableName, makeStableName) +import System.Mem.Weak (Weak, deRefWeak, finalize, mkWeak, mkWeakPtr) + +type MemoTable key val = + MVar + ( Int + , IOArray Int [MemoEntry key val] + ) + +data MemoEntry key val = MemoEntry !(StableName key) !(Weak val) + +memo :: (a -> b) -> a -> b +memo f = memoSized defaultTableSize f + +defaultTableSize :: Int +defaultTableSize = 1001 + +memoSized :: Int -> (a -> b) -> a -> b +memoSized size f = strict (lazyMemoSized size f) + +strict :: (a -> b) -> a -> b +strict = ($!) + +lazyMemoSized :: Int -> (a -> b) -> a -> b +lazyMemoSized size f = + let (table, weak) = + unsafePerformIO $ do + tbl <- newArray (0, size) [] + mvar <- newMVar (size, tbl) + weak <- mkWeakPtr mvar (Just (tableFinalizer tbl size)) + pure (mvar, weak) + in memo' f table weak + +tableFinalizer :: IOArray Int [MemoEntry key val] -> Int -> IO () +tableFinalizer table size = + sequence_ [finalizeBucket i | i <- [0 .. size]] + where + finalizeBucket i = do + bucket <- readArray table i + sequence_ [finalize w | MemoEntry _ w <- bucket] + +memo' :: (a -> b) -> MemoTable a b -> Weak (MemoTable a b) -> a -> b +memo' f ref weakRef = \k -> unsafePerformIO $ do + stableKey <- makeStableName k + (size, table) <- takeMVar ref + let hashKey = hashStableName stableKey `mod` size + bucket <- readArray table hashKey + lkp <- lookupSN stableKey bucket + case lkp of + Just result -> do + putMVar ref (size, table) + pure result + Nothing -> do + let result = f k + weak <- mkWeak k result (Just (finalizer hashKey stableKey weakRef)) + writeArray table hashKey (MemoEntry stableKey weak : bucket) + putMVar ref (size, table) + pure result + +finalizer :: Int -> StableName a -> Weak (MemoTable a b) -> IO () +finalizer hashKey stableKey weakRef = do + r <- deRefWeak weakRef + case r of + Nothing -> pure () + Just mvar -> do + (size, table) <- takeMVar mvar + bucket <- readArray table hashKey + let newBucket = + [ e + | e@(MemoEntry sn _) <- bucket + , sn /= stableKey + ] + writeArray table hashKey newBucket + putMVar mvar (size, table) + +lookupSN :: StableName key -> [MemoEntry key val] -> IO (Maybe val) +lookupSN sn [] = sn `seq` pure Nothing +lookupSN sn (MemoEntry sn' weak : xs) + | sn == sn' = do + maybeItem <- deRefWeak weak + case maybeItem of + Nothing -> error ("dead weak pair: " ++ show (hashStableName sn)) + Just v -> pure (Just v) + | otherwise = lookupSN sn xs ===================================== testsuite/tests/corelint/all.T ===================================== @@ -1,4 +1,5 @@ +test('T15907', only_ways(['normal']), multimod_compile, ['T15907', '-O -dannot-lint -v0']) test('T21115', normal, compile_fail, ['']) test('T21115b', req_th, compile_fail, ['-dsuppress-uniques -dsuppress-all']) test('T21152', normal, compile, ['-g3']) View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/517cf64e88567383017c0307d3c4f32… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/517cf64e88567383017c0307d3c4f32… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][master] Bump nofib submodule.
by Marge Bot (＠marge-bot) 11 Mar '26

11 Mar '26

Marge Bot pushed to branch master at Glasgow Haskell Compiler / GHC Commits: 664996c7 by Andreas Klebinger at 2026-03-11T15:02:16-04:00 Bump nofib submodule. We accrued a number of nofib fixes we want to have here. - - - - - 1 changed file: - nofib Changes: ===================================== nofib ===================================== @@ -1 +1 @@ -Subproject commit b7391df4540ac8b11b35e1b2e2c15819b5171798 +Subproject commit ae985b599e958414b327e4f220d99b7248601d55 View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/664996c73b31989c8b947dd4b583e9c… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/664996c73b31989c8b947dd4b583e9c… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][master] Add regression test for #18186
by Marge Bot (＠marge-bot) 11 Mar '26

11 Mar '26

Marge Bot pushed to branch master at Glasgow Haskell Compiler / GHC Commits: c3e64915 by Simon Jakobi at 2026-03-11T15:01:31-04:00 Add regression test for #18186 The original TypeInType language extension is replaced with DataKinds+PolyKinds for compatibility. Closes #18186. - - - - - 3 changed files: - + testsuite/tests/polykinds/T18186.hs - + testsuite/tests/polykinds/T18186.stderr - testsuite/tests/polykinds/all.T Changes: ===================================== testsuite/tests/polykinds/T18186.hs ===================================== @@ -0,0 +1,15 @@ +{-# LANGUAGE DataKinds #-} +{-# LANGUAGE PolyKinds #-} +{-# LANGUAGE ScopedTypeVariables #-} +{-# LANGUAGE TypeFamilies #-} + +module Main (main) where + +import Data.Kind (Type) + +type family F :: k -> Type +type family B (a :: k) (b :: k) :: k + +main :: IO () +main = + \(_ :: F n) -> (undefined :: B n 1) ===================================== testsuite/tests/polykinds/T18186.stderr ===================================== @@ -0,0 +1,10 @@ +T18186.hs:15:32: error: [GHC-83865] + • Expected a type, + but ‘B n 1’ has kind + ‘GHC.Internal.Bignum.Natural.Natural’ + • In an expression type signature: B n 1 + In the expression: undefined :: B n 1 + The lambda expression ‘\ (_ :: F n) -> ...’ + has one visible argument, + but its type ‘IO ()’ has none + ===================================== testsuite/tests/polykinds/all.T ===================================== @@ -223,6 +223,7 @@ test('T16902', normal, compile_fail, ['']) test('CuskFam', normal, compile, ['']) test('T17841', normal, compile_fail, ['']) test('T17963', normal, compile_fail, ['']) +test('T18186', normal, compile_fail, ['']) test('T18300', normal, compile_fail, ['']) test('T18451', normal, compile_fail, ['']) test('T18451a', normal, compile_fail, ['']) View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/c3e649152f1ad14eec4e83c1ec1be3a… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/c3e649152f1ad14eec4e83c1ec1be3a… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][master] hadrian: remove the broken bench flavour
by Marge Bot (＠marge-bot) 11 Mar '26

11 Mar '26

Marge Bot pushed to branch master at Glasgow Haskell Compiler / GHC Commits: 604e1180 by Cheng Shao at 2026-03-11T15:00:42-04:00 hadrian: remove the broken bench flavour This patch removes the bench flavour from hadrian which has been broken for years and not used for actual benchmarking (for which `perf`/`release` is used instead). Closes #26825. - - - - - 4 changed files: - hadrian/doc/flavours.md - hadrian/hadrian.cabal - hadrian/src/Settings.hs - − hadrian/src/Settings/Flavours/Benchmark.hs Changes: ===================================== hadrian/doc/flavours.md ===================================== @@ -118,18 +118,6 @@ when compiling the `compiler` library, and `hsGhc` when compiling/linking the GH <td>-O</td> <td>-O2</td> </tr> - <tr> - <th>bench</td> - <td></td> - <td>-O +RTS -O64M -RTS</td> - <td>-O +RTS -O64M -RTS</td> - <td></td> - <td>-O2</td> - <td>-O2</td> - <td>-O0</td> - <td>-O2</td> - <td>-O2</td> - </tr> <tr> <th>devel1</td> <td></td> @@ -404,7 +392,7 @@ information. The following table lists ways that are built in different flavours <td>debug threaded threadedDebug debugDynamic threadedDynamic threadedDebugDynamic</td> </tr> <tr> - <th>quickest bench</th> + <th>quickest</th> <td>vanilla</td> <td>vanilla</td> <td>vanilla threaded</td> ===================================== hadrian/hadrian.cabal ===================================== @@ -119,7 +119,6 @@ executable hadrian , Settings.Builders.Win32Tarballs , Settings.Builders.Xelatex , Settings.Default - , Settings.Flavours.Benchmark , Settings.Flavours.Development , Settings.Flavours.GhcInGhci , Settings.Flavours.Performance ===================================== hadrian/src/Settings.hs ===================================== @@ -17,7 +17,6 @@ import Settings.Parser import UserSettings (userFlavours, userPackages, userDefaultFlavour) import {-# SOURCE #-} Settings.Default -import Settings.Flavours.Benchmark import Settings.Flavours.Development import Settings.Flavours.GhcInGhci import Settings.Flavours.Performance @@ -59,7 +58,7 @@ stagePackages stage = do hadrianFlavours :: [Flavour] hadrianFlavours = - [ benchmarkFlavour, defaultFlavour, developmentFlavour Stage1 + [ defaultFlavour, developmentFlavour Stage1 , developmentFlavour Stage2, performanceFlavour , releaseFlavour , quickFlavour, quickValidateFlavour, quickDebugFlavour ===================================== hadrian/src/Settings/Flavours/Benchmark.hs deleted ===================================== @@ -1,25 +0,0 @@ -module Settings.Flavours.Benchmark (benchmarkFlavour) where - -import qualified Data.Set as Set -import Expression -import Flavour -import Oracles.Flag -import {-# SOURCE #-} Settings.Default - --- Please update doc/flavours.md when changing this file. -benchmarkFlavour :: Flavour -benchmarkFlavour = defaultFlavour - { name = "bench" - , extraArgs = benchmarkArgs <> defaultHaddockExtraArgs - , libraryWays = pure $ Set.fromList [vanilla] - , rtsWays = Set.fromList <$> mconcat [pure [vanilla], targetSupportsThreadedRts ? pure [threaded]] } - -benchmarkArgs :: Args -benchmarkArgs = sourceArgs SourceArgs - { hsDefault = pure ["-O", "+RTS", "-O64M", "-RTS"] - , hsLibrary = pure ["-O2"] - -- TODO: We should really pass -O2 when notStage0. Otherwise, we aren't - -- really measuring the overhead of a potential new optimisation we want - -- to benchmark. This has to happen in sync with the Makefile build, though. - , hsCompiler = mconcat [stage0 ? arg "-O2", notStage0 ? arg "-O0"] - , hsGhc = pure ["-O2"] } View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/604e118083ac284083f1eac2d55ec08… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/604e118083ac284083f1eac2d55ec08… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/T26878] Simplify mkTick
by sheaf (＠sheaf) 11 Mar '26

11 Mar '26

sheaf pushed to branch wip/T26878 at Glasgow Haskell Compiler / GHC Commits: d45e6b52 by Simon Peyton Jones at 2026-03-11T19:53:27+01:00 Simplify mkTick This commit simplifies 'GHC.Core.Utils.mkTick', removing the accumulating parameter 'rest' which was suspiciously treating a bunch of different ticks as a group, and moving the group as a whole around the AST, ignoring that the ticks in the group might have different placement properties. A few other changes are also implemented: - simplify 'can_split' predicate (no functional change) - drop profiling ticks around coercions, fixing #26941 - combine profiling ticks into one when possible Fixes #26878 and #26941 Co-authored-by: sheaf <sam.derbyshire(a)gmail.com> - - - - - 5 changed files: - compiler/GHC/Core/Utils.hs - compiler/GHC/Types/Tickish.hs - + testsuite/tests/simplCore/should_compile/T26941.hs - + testsuite/tests/simplCore/should_compile/T26941_aux.hs - testsuite/tests/simplCore/should_compile/all.T Changes: ===================================== compiler/GHC/Core/Utils.hs ===================================== @@ -303,59 +303,72 @@ mkCast expr co * * ********************************************************************* -} --- | Wraps the given expression in the source annotation, dropping the --- annotation if possible. +-- | Wraps the given expression in a Tick while respecting Tick invariants, +-- and performing small on-the-fly optimisations. +-- +-- Prefer using 'mkTick' over explicit use of the 'Tick' constructor. +-- +-- Small optimisations performed: +-- +-- * Minimise the AST covered by the tick, by pushing the tick deeper into +-- the expression if this doesn't change the semantics of the tick. +-- For example, push runtime relevant ticks through type applications +-- and type lambdas. +-- * Eliminate unnecessary ticks by either absorbing them into existing ones +-- or dropping them if that is valid (e.g. dropping profiling ticks around +-- types, coercions and literals). +-- * Split profiling ticks into counting/scoping parts so that the two parts +-- can be placed independently into the AST. mkTick :: CoreTickish -> CoreExpr -> CoreExpr -mkTick t orig_expr = mkTick' id orig_expr +mkTick t orig_expr = mkTick' orig_expr where -- Some ticks (cost-centres) can be split in two, with the -- non-counting part having laxer placement properties. - canSplit = tickishCanSplit t && tickishPlace (mkNoCount t) /= tickishPlace t + -- See Note [Scoping ticks and counting ticks] in GHC.Types.Tickish. + can_split = tickishCanSplit t - -- mkTick' handles floating of ticks *into* the expression. - mkTick' :: (CoreExpr -> CoreExpr) -- Apply before adding tick (float with) - -- Always a composition of (Tick t) wrappers - -> CoreExpr -- Current expression - -> CoreExpr - -- So in the call (mkTick' rest e), the expression - -- (rest e) - -- has the same type as e - -- Returns an expression equivalent to (Tick t (rest e)) - mkTick' rest expr = case expr of - -- Float ticks into unsafe coerce the same way we would do with a cast. - Case scrut bndr ty alts@[Alt ac abs _rhs] - | Just rhs <- isUnsafeEqualityCase scrut bndr alts - -> Case scrut bndr ty [Alt ac abs (mkTick' rest rhs)] + stop_here e = Tick t e -- Just wrap `t` around the current expression + -- That's the default option! - -- Cost centre ticks should never be reordered relative to each - -- other. Therefore we can stop whenever two collide. + -- mkTick' handles floating of tick `t` *into* the expression. + mkTick' :: CoreExpr -> CoreExpr + mkTick' expr = case expr of Tick t2 e - | ProfNote{} <- t2, ProfNote{} <- t -> Tick t $ rest expr - - -- Otherwise we assume that ticks of different placements float - -- through each other. - | tickishPlace t2 /= tickishPlace t -> Tick t2 $ mkTick' rest e + | ProfNote { profNoteCC = cc1, profNoteCount = cnt1, profNoteScope = scope1 } <- t + , ProfNote { profNoteCC = cc2, profNoteCount = cnt2, profNoteScope = scope2 } <- t2 + -> + -- Common up ticks with a shared cost centre. + -- Alas, if both ticks count, we are forced to retain both. + if cc1 == cc2 && (not cnt1 || not cnt2) + then + let t' = ProfNote { profNoteCC = cc1 + , profNoteCount = cnt1 || cnt2 + , profNoteScope = scope1 || scope2 + } + in mkTick t' e + else + -- Cost centre ticks for different cost centres should never be reordered + -- relative to each other. Therefore we can stop whenever two collide. + stop_here expr + + | tickishPlace t2 /= tickishPlace t + -> -- Otherwise, we assume that ticks of different + -- placements float through each other. + Tick t2 $ mkTick' e + + -- For source note ticks, this is where we make sure to + -- not introduce redundant ticks. + | tickishContains t t2 -> mkTick' e -- Drop t2 + | tickishContains t2 t -> expr -- Drop t - -- For annotations this is where we make sure to not introduce - -- redundant ticks. - | tickishContains t t2 -> mkTick' rest e -- Drop t2 - | tickishContains t2 t -> rest e -- Drop t - | otherwise -> mkTick' (rest . Tick t2) e - - -- Ticks don't care about types, so we just float all ticks - -- through them. Note that it's not enough to check for these - -- cases top-level. While mkTick will never produce Core with type - -- expressions below ticks, such constructs can be the result of - -- unfoldings. We therefore make an effort to put everything into - -- the right place no matter what we start with. - Cast e co -> mkCast (mkTick' rest e) co - Coercion co -> Tick t $ rest (Coercion co) + | otherwise + -> stop_here expr -- Always safe Lam x e -- Always float through type lambdas. Even for non-type lambdas, -- floating is allowed for all but the most strict placement rule. | not (isRuntimeVar x) || tickishPlace t /= PlaceRuntime - -> Lam x $ mkTick' rest e + -> Lam x $ mkTick' e -- If it is both counting and scoped, we split the tick into its -- two components, often allowing us to keep the counting tick on @@ -363,26 +376,41 @@ mkTick t orig_expr = mkTick' id orig_expr -- The point of this is that the counting tick can probably be -- floated, and the lambda may then be in a position to be -- beta-reduced. - | canSplit - -> Tick (mkNoScope t) $ rest $ Lam x $ mkTick (mkNoCount t) e + | can_split + -> Tick (mkNoScope t) $ Lam x $ mkTick (mkNoCount t) e App f arg -- Always float through type applications. | not (isRuntimeArg arg) - -> App (mkTick' rest f) arg + -> App (mkTick' f) arg -- We can also float through constructor applications, placement - -- permitting. Again we can split. - | isSaturatedConApp expr && (tickishPlace t==PlaceCostCentre || canSplit) + -- permitting. Again we can try splitting. + | isSaturatedConApp expr + , tickishPlace t == PlaceCostCentre || can_split -> if tickishPlace t == PlaceCostCentre - then rest $ tickHNFArgs t expr - else Tick (mkNoScope t) $ rest $ tickHNFArgs (mkNoCount t) expr + then tickHNFArgs t expr + else Tick (mkNoScope t) $ tickHNFArgs (mkNoCount t) expr + + -- Ticks don't care about types, so we just float all ticks + -- through them. Note that it's not enough to check for these + -- cases at the top-level. While mkTick will never produce Core with type + -- expressions below ticks, such constructs can be the result of + -- unfoldings. We therefore make an effort to put everything into + -- the right place no matter what we start with. + Cast e co -> mkCast (mkTick' e) co + + -- Float ticks into 'unsafeCoerce' the same way we would do with a cast. + Case scrut bndr ty alts@[Alt ac abs _rhs] + | Just rhs <- isUnsafeEqualityCase scrut bndr alts + -> Case scrut bndr ty [Alt ac abs (mkTick' rhs)] Var x - | notFunction && tickishPlace t == PlaceCostCentre - -> rest expr -- Drop t - | notFunction && canSplit - -> Tick (mkNoScope t) $ rest expr + | notFunction + , tickishPlace t == PlaceCostCentre || can_split + -> if tickishPlace t == PlaceCostCentre + then expr -- Drop tick t entirely + else Tick (mkNoScope t) expr where -- SCCs can be eliminated on variables provided the variable -- is not a function. In these cases the SCC makes no difference: @@ -392,12 +420,24 @@ mkTick t orig_expr = mkTick' id orig_expr -- when the function is called, so we must retain those. notFunction = not (isFunTy (idType x)) + Coercion co + -- Make sure to drop SCCs around coercions, to avoid generating Core + -- of the form 'let co = scc<foo> <Int>_N' (which Core Lint isn't happy with). + -- See #26941. + | tickishPlace t == PlaceCostCentre + -> Coercion co -- Drop tick t entirely + | can_split + -> Tick (mkNoScope t) expr + Lit{} | tickishPlace t == PlaceCostCentre - -> rest expr -- Drop t + -> expr -- Drop tick t entirely + | can_split + -> Tick (mkNoScope t) expr - -- Catch-all: Annotate where we stand - _any -> Tick t $ rest expr + -- Catch-all: Annotate where we stand. + -- Used for Type, Let, most Cases + _any -> Tick t expr mkTicks :: [CoreTickish] -> CoreExpr -> CoreExpr mkTicks ticks expr = foldr mkTick expr ticks ===================================== compiler/GHC/Types/Tickish.hs ===================================== @@ -261,6 +261,10 @@ Ticks have two independent attributes: See Note [Scoped ticks] +Note that profiling notes which both count and scope can be split into two +separate ticks, one that counts and doesn't scope and one that scopes and doesn't +count; see 'tickishCanSplit', 'mkNoCount' and 'mkNoScope'. + Note [Counting ticks] ~~~~~~~~~~~~~~~~~~~~ The following ticks count: @@ -451,7 +455,7 @@ data TickishPlacement = -- legal placement rule for counting ticks. -- NB: We generally try to move these as close to the relevant -- runtime expression as possible. This means they get pushed through - -- tyoe arguments. E.g. we create `(tick f) @Bool` instead of `tick (f @Bool)`. + -- type arguments. E.g. we create `(tick f) @Bool` instead of `tick (f @Bool)`. PlaceRuntime -- | As @PlaceRuntime@, but we float the tick through all ===================================== testsuite/tests/simplCore/should_compile/T26941.hs ===================================== @@ -0,0 +1,14 @@ +{-# LANGUAGE DataKinds #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE TypeOperators #-} + +module T26941 where + +import GHC.TypeLits + +import T26941_aux ( SMayNat(SKnown), ListH, shxHead ) + +shsHead :: ListH (Just n : sh) Int -> SNat n +shsHead shx = + case shxHead shx of + SKnown SNat -> SNat ===================================== testsuite/tests/simplCore/should_compile/T26941_aux.hs ===================================== @@ -0,0 +1,20 @@ +{-# LANGUAGE DataKinds #-} +{-# LANGUAGE GADTs #-} +{-# LANGUAGE StandaloneKindSignatures #-} +{-# LANGUAGE TypeOperators #-} + +module T26941_aux where + +import Data.Kind +import GHC.TypeLits + +shxHead :: ListH (n : sh) i -> SMayNat i n +shxHead list = {-# SCC "bad_scc" #-} + ( case list of (i `ConsKnown` _) -> SKnown i ) + +type ListH :: [Maybe Nat] -> Type -> Type +data ListH sh i where + ConsKnown :: SNat n -> ListH sh i -> ListH (Just n : sh) i + +data SMayNat i n where + SKnown :: SNat n -> SMayNat i (Just n) ===================================== testsuite/tests/simplCore/should_compile/all.T ===================================== @@ -568,6 +568,8 @@ test('T26117', [grep_errmsg(r'==')], compile, ['-O -ddump-simpl -dsuppress-uniqu test('T26349', normal, compile, ['-O -ddump-rules']) test('T26681', normal, compile, ['-O']) +test('T26941', [extra_files(['T26941_aux.hs']), req_profiling], multimod_compile, ['T26941', '-v0 -O -prof']) + # T26709: we expect three `case` expressions not four test('T26709', [grep_errmsg(r'case')], multimod_compile, View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/d45e6b52f4cc31c96b918f0a0e0ab89… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/d45e6b52f4cc31c96b918f0a0e0ab89… 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] Fix terminfo dependency
by Sven Tennie (＠supersven) 11 Mar '26

11 Mar '26

Sven Tennie pushed to branch wip/romes/hadrian-cross-stage2-rebase_SVEN_FINAL at Glasgow Haskell Compiler / GHC Commits: c2cb2d36 by GHC GitLab CI at 2026-03-11T18:57:08+00:00 Fix terminfo dependency - - - - - 1 changed file: - hadrian/src/Settings/Packages.hs Changes: ===================================== hadrian/src/Settings/Packages.hs ===================================== @@ -196,11 +196,13 @@ packageArgs = do -- and executables. This flag disables the latter. , package haskeline ? builder (Cabal Flags) ? arg "-examples" - -- Don't depend upon terminfo when cross-compiling to avoid unnecessary - -- dependencies unless the user provided ncurses explicitly. + -- Don't depend upon terminfo in early stages or when cross-compiling, + -- to avoid unnecessary dependencies unless the user provided ncurses + -- explicitly. For non-cross builds, terminfo is only enabled from + -- Stage2 onwards (i.e. when building the final compiler). -- TODO: Perhaps the user should be able to explicitly enable/disable this. , package haskeline ? - builder (Cabal Flags) ? orM [ notM cross, haveCurses ] `cabalFlag` "terminfo" + builder (Cabal Flags) ? orM [ andM [notM cross, return (stage >= Stage2)], haveCurses ] `cabalFlag` "terminfo" -------------------------------- terminfo ------------------------------ , package terminfo ? View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/c2cb2d36753a1e657bd2c78ba832fb0… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/c2cb2d36753a1e657bd2c78ba832fb0… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/9.12.4-backports-2] Release notes for 9.12.4
by Zubin (＠wz1000) 11 Mar '26

11 Mar '26

Zubin pushed to branch wip/9.12.4-backports-2 at Glasgow Haskell Compiler / GHC Commits: 097556ce by Zubin Duggal at 2026-03-12T00:21:29+05:30 Release notes for 9.12.4 Metric Increase: T4801 - - - - - 1 changed file: - docs/users_guide/9.12.4-notes.rst Changes: ===================================== docs/users_guide/9.12.4-notes.rst ===================================== @@ -30,17 +30,30 @@ Compiler - Fixed a subtle bug in ``GHC.Core.Utils.mkTick`` that could generate type-incorrect code (:ghc-ticket:`26772`) - Fixed a long-standing interaction between ticks and casts in ``Eliminate Identity Cases`` - ``NamedDefaults``: require the class to be standard or have an in-scope default declaration (:ghc-ticket:`25775`, :ghc-ticket:`25778`) +- ``NamedDefaults``: allow named defaults for poly-kinded unary classes such as ``Typeable`` (:ghc-ticket:`25882`) +- Improved compiler performance by making ``OccAnal`` stricter, reducing residency and improving compile times +- Fixed two critical Cmm register bugs affecting spill/reload behavior with vector types (:ghc-ticket:`26542`, :ghc-ticket:`26550`) +- Fixed the order of spill/reload instructions in the native code generator (:ghc-ticket:`26537`) +- Fixed five register allocation bugs relating to register formats, preventing data corruption when spilling and reloading vector registers (:ghc-ticket:`26411`, :ghc-ticket:`26526`) +- Fixed PPC NCG shift right operations at smaller than word sizes (:ghc-ticket:`26519`) +- Fixed associated type family changes not triggering recompilation in dependent modules (:ghc-ticket:`26183`) +- Fixed data family instance type class instance changes not triggering recompilation (:ghc-ticket:`26705`) +- Fixed negative type literals bypassing the renamer check via ``RequiredTypeArguments``, causing the compiler to hang (:ghc-ticket:`26861`) +- Fixed scoping errors in the type-class specialiser (:ghc-ticket:`26682`) +- Fixed sign extension and casting for LLVM bit manipulation operations (:ghc-ticket:`20645`, :ghc-ticket:`26109`) +- Fixed LLVM linking of Intel BMI intrinsics ``pdep{8,16}`` and ``pext{8,16}`` (:ghc-ticket:`26065`) Runtime System ~~~~~~~~~~~~~~ - Fixed a deadlock with eventlog flush interval and RTS shutdown (:ghc-ticket:`26573`) -- Fixed eager black holes: record mutated closure and fix assertion (:ghc-ticket:`26495`) +- Handle 16-bit overflow of ELF section header string table (:ghc-ticket:`26603`) - Fixed object file format detection in ``loadArchive`` (:ghc-ticket:`26630`) - Use ``INFO_TABLE_CONSTR`` for ``stg_dummy_ret_closure`` (:ghc-ticket:`26745`) - Fixed lost wakeups in ``threadPaused`` for threads blocked on black holes (:ghc-ticket:`26324`) - Fixed ``stg_AP_STACK`` to push the correct update frame (:ghc-ticket:`26324`) - Fixed potential loop in heap reservation logic on certain kernels (:ghc-ticket:`26151`) +- The runtime linker now supports COMMON symbols (:ghc-ticket:`6107`) - Don't use CAS without ``PARALLEL_GC`` on - Switch prim to use modern atomic compiler builtins (:ghc-ticket:`26729`) - Removed obsolete ``CC_SUPPORTS_TLS``, ``HAS_VISIBILITY_HIDDEN``, ``COMPILING_WINDOWS_DLL``, @@ -63,6 +76,7 @@ Bytecode Compiler ~~~~~~~~~~~~~~~~ - Expose ``Backtraces`` constructor and fields (:ghc-ticket:`26049`) +- Added ``@since`` annotation to ``System.Info.fullCompilerVersion`` (:ghc-ticket:`26973`) - Store ``StackTrace`` and ``StackSnapshot`` in ``Backtraces``, deferring decoding until display - Evaluate backtraces for ``error`` exceptions at the moment they are thrown (`CLC proposal #383 <https://github.com/haskell/core-libraries-committee/issues/383>`__, View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/097556ce96a33f863edb4adcebd966e… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/097556ce96a33f863edb4adcebd966e… You're receiving this email because of your account on gitlab.haskell.org.

1 0