- ghc-commits - Haskell.org

[Git][ghc/ghc] Pushed new branch wip/remove-othersection
by Cheng Shao (＠TerrorJack) 17 Dec '25

17 Dec '25

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

1 0

[Git][ghc/ghc] Pushed new branch wip/lazy-iface-decl-loading
by Matthew Pickering (＠mpickering) 17 Dec '25

17 Dec '25

Matthew Pickering pushed new branch wip/lazy-iface-decl-loading at Glasgow Haskell Compiler / GHC -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/tree/wip/lazy-iface-decl-loading You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/spj-try-opt-coercion] Update user manual
by Simon Peyton Jones (＠simonpj) 17 Dec '25

17 Dec '25

Simon Peyton Jones pushed to branch wip/spj-try-opt-coercion at Glasgow Haskell Compiler / GHC Commits: e3169203 by Simon Peyton Jones at 2025-12-17T15:55:50+00:00 Update user manual - - - - - 1 changed file: - docs/users_guide/using-optimisation.rst Changes: ===================================== docs/users_guide/using-optimisation.rst ===================================== @@ -996,14 +996,15 @@ as such you shouldn't need to set any of them explicitly. A flag a warning if the number of arguments in the resulting function would exceed the value given by ``-fmax-forced-spec-args``. -.. ghc-flag:: -fno-opt-coercion - :shortdesc: Turn off the coercion optimiser +.. ghc-flag:: -fopt-coercion + :shortdesc: Turn on the coercion optimiser :type: dynamic + :reverse: -fno-opt-coercion :category: - :default: coercion optimisation enabled. + :default: on - Turn off the coercion optimiser. + Turn on the coercion optimiser. .. ghc-flag:: -fno-pre-inlining :shortdesc: Turn off pre-inlining View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/e31692034284c62ad30dfdf9d4870f3… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/e31692034284c62ad30dfdf9d4870f3… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc] Pushed new branch wip/T26681
by Simon Peyton Jones (＠simonpj) 17 Dec '25

17 Dec '25

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

1 0

[Git][ghc/ghc][wip/terrorjack/asan] 3 commits: hadrian: add support for building with AddressSanitizer
by Cheng Shao (＠TerrorJack) 17 Dec '25

17 Dec '25

Cheng Shao pushed to branch wip/terrorjack/asan at Glasgow Haskell Compiler / GHC Commits: 2f2927b3 by Cheng Shao at 2025-12-17T15:48:29+01:00 hadrian: add support for building with AddressSanitizer This patch adds a +asan flavour transformer to hadrian to build all stage1+ C/C++ code with AddressBehaviorSanitizer. This is particularly useful to catch potential out-of-bounds and use-after-free bugs in the RTS codebase. - - - - - 00bab58c by Cheng Shao at 2025-12-17T15:48:40+01:00 ci: add ubsan+asan job We now have a `x86_64-linux-fedora43-validate+debug_info+ubsan+asan` validate/nightly job with both UBSan/ASan enabled. - - - - - d8793b80 by Cheng Shao at 2025-12-17T15:48:40+01:00 rts: add ASAN poisoning to mblock allocator - - - - - 13 changed files: - .gitlab/generate-ci/gen_ci.hs - .gitlab/jobs.yaml - hadrian/doc/flavours.md - hadrian/src/Flavour.hs - rts/include/Stg.h - + rts/include/rts/ASANUtils.h - rts/rts.cabal - rts/sm/MBlock.c - testsuite/driver/testglobals.py - testsuite/driver/testlib.py - testsuite/tests/ffi/should_run/all.T - testsuite/tests/rts/T18623/all.T - testsuite/tests/rts/all.T Changes: ===================================== .gitlab/generate-ci/gen_ci.hs ===================================== @@ -162,6 +162,7 @@ data BuildConfig , tablesNextToCode :: Bool , threadSanitiser :: Bool , ubsan :: Bool + , asan :: Bool , noSplitSections :: Bool , validateNonmovingGc :: Bool , textWithSIMDUTF :: Bool @@ -173,7 +174,7 @@ configureArgsStr :: BuildConfig -> String configureArgsStr bc = unwords $ ["--enable-unregisterised"| unregisterised bc ] ++ ["--disable-tables-next-to-code" | not (tablesNextToCode bc) ] - ++ ["--with-intree-gmp" | Just _ <- pure (crossTarget bc) ] + ++ ["--with-intree-gmp" | isJust (crossTarget bc) || ubsan bc || asan bc ] ++ ["--with-system-libffi" | crossTarget bc == Just "wasm32-wasi" ] ++ ["--enable-ipe-data-compression" | withZstd bc ] ++ ["--enable-strict-ghc-toolchain-check"] @@ -188,6 +189,7 @@ mkJobFlavour BuildConfig{..} = Flavour buildFlavour opts [HostFullyStatic | hostFullyStatic] ++ [ThreadSanitiser | threadSanitiser] ++ [UBSan | ubsan] ++ + [ASan | asan] ++ [NoSplitSections | noSplitSections, buildFlavour == Release ] ++ [BootNonmovingGc | validateNonmovingGc ] ++ [TextWithSIMDUTF | textWithSIMDUTF] @@ -201,6 +203,7 @@ data FlavourTrans = | HostFullyStatic | ThreadSanitiser | UBSan + | ASan | NoSplitSections | BootNonmovingGc | TextWithSIMDUTF @@ -230,6 +233,7 @@ vanilla = BuildConfig , tablesNextToCode = True , threadSanitiser = False , ubsan = False + , asan = False , noSplitSections = False , validateNonmovingGc = False , textWithSIMDUTF = False @@ -283,8 +287,8 @@ llvm = vanilla { llvmBootstrap = True } tsan :: BuildConfig tsan = vanilla { threadSanitiser = True } -enableUBSan :: BuildConfig -enableUBSan = vanilla { withDwarf = True, ubsan = True } +enableUBSanASan :: BuildConfig +enableUBSanASan = vanilla { withDwarf = True, ubsan = True, asan = True } noTntc :: BuildConfig noTntc = vanilla { tablesNextToCode = False } @@ -381,6 +385,7 @@ flavourString (Flavour base trans) = base_string base ++ concatMap (("+" ++) . f flavour_string HostFullyStatic = "host_fully_static" flavour_string ThreadSanitiser = "thread_sanitizer_cmm" flavour_string UBSan = "ubsan" + flavour_string ASan = "asan" flavour_string NoSplitSections = "no_split_sections" flavour_string BootNonmovingGc = "boot_nonmoving_gc" flavour_string TextWithSIMDUTF = "text_simdutf" @@ -1213,15 +1218,24 @@ fedora_x86 = , hackage_doc_job (disableValidate (standardBuildsWithConfig Amd64 (Linux Fedora43) releaseConfig)) , disableValidate (standardBuildsWithConfig Amd64 (Linux Fedora43) dwarf) , disableValidate (standardBuilds Amd64 (Linux Fedora43)) - -- For UBSan jobs, only enable for validate/nightly pipelines. - -- Also disable docs since it's not the point for UBSan jobs. + -- For UBSan/ASan jobs, only enable for validate/nightly + -- pipelines. Also disable docs since it's not the point for + -- UBSan/ASan jobs. + -- + -- See + -- https://github.com/llvm/llvm-project/blob/llvmorg-21.1.8/compiler-rt/lib/sa… + -- for ASAN options help, for now these are required to pass the + -- testsuite , modifyJobs ( setVariable "HADRIAN_ARGS" "--docs=none" . addVariable "UBSAN_OPTIONS" "suppressions=$CI_PROJECT_DIR/rts/.ubsan-suppressions" + . addVariable + "ASAN_OPTIONS" + "detect_leaks=false:handle_segv=0:handle_sigfpe=0:verify_asan_link_order=false" ) - $ validateBuilds Amd64 (Linux Fedora43) enableUBSan + $ validateBuilds Amd64 (Linux Fedora43) enableUBSanASan ] where hackage_doc_job = rename (<> "-hackage") . modifyJobs (addVariable "HADRIAN_ARGS" "--haddock-for-hackage") ===================================== .gitlab/jobs.yaml ===================================== @@ -3195,7 +3195,7 @@ "XZ_OPT": "-9" } }, - "nightly-x86_64-linux-fedora43-validate+debug_info+ubsan": { + "nightly-x86_64-linux-fedora43-validate+debug_info+ubsan+asan": { "after_script": [ ".gitlab/ci.sh save_cache", ".gitlab/ci.sh save_test_output", @@ -3206,7 +3206,7 @@ "artifacts": { "expire_in": "8 weeks", "paths": [ - "ghc-x86_64-linux-fedora43-validate+debug_info+ubsan.tar.xz", + "ghc-x86_64-linux-fedora43-validate+debug_info+ubsan+asan.tar.xz", "junit.xml", "unexpected-test-output.tar.gz" ], @@ -3248,14 +3248,15 @@ "x86_64-linux" ], "variables": { + "ASAN_OPTIONS": "detect_leaks=false:handle_segv=0:handle_sigfpe=0:verify_asan_link_order=false", "BIGNUM_BACKEND": "gmp", - "BIN_DIST_NAME": "ghc-x86_64-linux-fedora43-validate+debug_info+ubsan", - "BUILD_FLAVOUR": "validate+debug_info+ubsan", - "CONFIGURE_ARGS": "--enable-strict-ghc-toolchain-check", + "BIN_DIST_NAME": "ghc-x86_64-linux-fedora43-validate+debug_info+ubsan+asan", + "BUILD_FLAVOUR": "validate+debug_info+ubsan+asan", + "CONFIGURE_ARGS": "--with-intree-gmp --enable-strict-ghc-toolchain-check", "HADRIAN_ARGS": "--docs=none", "INSTALL_CONFIGURE_ARGS": "--enable-strict-ghc-toolchain-check", "RUNTEST_ARGS": "", - "TEST_ENV": "x86_64-linux-fedora43-validate+debug_info+ubsan", + "TEST_ENV": "x86_64-linux-fedora43-validate+debug_info+ubsan+asan", "UBSAN_OPTIONS": "suppressions=$CI_PROJECT_DIR/rts/.ubsan-suppressions", "XZ_OPT": "-9" } @@ -7346,7 +7347,7 @@ "TEST_ENV": "x86_64-linux-fedora43-validate+debug_info" } }, - "x86_64-linux-fedora43-validate+debug_info+ubsan": { + "x86_64-linux-fedora43-validate+debug_info+ubsan+asan": { "after_script": [ ".gitlab/ci.sh save_cache", ".gitlab/ci.sh save_test_output", @@ -7357,7 +7358,7 @@ "artifacts": { "expire_in": "2 weeks", "paths": [ - "ghc-x86_64-linux-fedora43-validate+debug_info+ubsan.tar.xz", + "ghc-x86_64-linux-fedora43-validate+debug_info+ubsan+asan.tar.xz", "junit.xml", "unexpected-test-output.tar.gz" ], @@ -7383,7 +7384,7 @@ ], "rules": [ { - "if": "((($ONLY_JOBS) && ($ONLY_JOBS =~ /.*\\bx86_64-linux-fedora43-validate\\+debug_info\\+ubsan(\\s|$).*/)) || (($ONLY_JOBS == null) && ((($CI_MERGE_REQUEST_LABELS =~ /.*full-ci.*/) || ($CI_MERGE_REQUEST_LABELS =~ /.*marge_bot_batch_merge_job.*/) || ($CI_COMMIT_BRANCH == \"master\") || ($CI_COMMIT_BRANCH =~ /ghc-[0-9]+\\.[0-9]+/))))) && ($RELEASE_JOB != \"yes\") && ($NIGHTLY == null)", + "if": "((($ONLY_JOBS) && ($ONLY_JOBS =~ /.*\\bx86_64-linux-fedora43-validate\\+debug_info\\+ubsan\\+asan(\\s|$).*/)) || (($ONLY_JOBS == null) && ((($CI_MERGE_REQUEST_LABELS =~ /.*full-ci.*/) || ($CI_MERGE_REQUEST_LABELS =~ /.*marge_bot_batch_merge_job.*/) || ($CI_COMMIT_BRANCH == \"master\") || ($CI_COMMIT_BRANCH =~ /ghc-[0-9]+\\.[0-9]+/))))) && ($RELEASE_JOB != \"yes\") && ($NIGHTLY == null)", "when": "on_success" } ], @@ -7399,14 +7400,15 @@ "x86_64-linux" ], "variables": { + "ASAN_OPTIONS": "detect_leaks=false:handle_segv=0:handle_sigfpe=0:verify_asan_link_order=false", "BIGNUM_BACKEND": "gmp", - "BIN_DIST_NAME": "ghc-x86_64-linux-fedora43-validate+debug_info+ubsan", - "BUILD_FLAVOUR": "validate+debug_info+ubsan", - "CONFIGURE_ARGS": "--enable-strict-ghc-toolchain-check", + "BIN_DIST_NAME": "ghc-x86_64-linux-fedora43-validate+debug_info+ubsan+asan", + "BUILD_FLAVOUR": "validate+debug_info+ubsan+asan", + "CONFIGURE_ARGS": "--with-intree-gmp --enable-strict-ghc-toolchain-check", "HADRIAN_ARGS": "--docs=none", "INSTALL_CONFIGURE_ARGS": "--enable-strict-ghc-toolchain-check", "RUNTEST_ARGS": "", - "TEST_ENV": "x86_64-linux-fedora43-validate+debug_info+ubsan", + "TEST_ENV": "x86_64-linux-fedora43-validate+debug_info+ubsan+asan", "UBSAN_OPTIONS": "suppressions=$CI_PROJECT_DIR/rts/.ubsan-suppressions" } }, ===================================== hadrian/doc/flavours.md ===================================== @@ -242,6 +242,10 @@ The supported transformers are listed below: <td><code>ubsan</code></td> <td>Build all stage1+ C/C++ code with UndefinedBehaviorSanitizer support</td> </tr> + <tr> + <td><code>asan</code></td> + <td>Build all stage1+ C/C++ code with AddressSanitizer support</td> + </tr> <tr> <td><code>llvm</code></td> <td>Use GHC's LLVM backend (`-fllvm`) for all stage1+ compilation.</td> ===================================== hadrian/src/Flavour.hs ===================================== @@ -8,6 +8,7 @@ module Flavour , splitSections , enableThreadSanitizer , enableUBSan + , enableASan , enableLateCCS , enableHashUnitIds , enableDebugInfo, enableTickyGhc @@ -56,6 +57,7 @@ flavourTransformers = M.fromList , "thread_sanitizer" =: enableThreadSanitizer False , "thread_sanitizer_cmm" =: enableThreadSanitizer True , "ubsan" =: enableUBSan + , "asan" =: enableASan , "llvm" =: viaLlvmBackend , "profiled_ghc" =: enableProfiledGhc , "no_dynamic_ghc" =: disableDynamicGhcPrograms @@ -303,6 +305,28 @@ enableUBSan = builder Testsuite ? arg "--config=have_ubsan=True" ] +-- | Build all stage1+ C/C++ code with AddressSanitizer support: +-- https://clang.llvm.org/docs/AddressSanitizer.html +enableASan :: Flavour -> Flavour +enableASan = + addArgs $ + notStage0 + ? mconcat + [ package rts + ? builder (Cabal Flags) + ? arg "+asan" + <> (needSharedLibSAN ? arg "+shared-libsan"), + builder (Ghc CompileHs) ? arg "-optc-fsanitize=address", + builder (Ghc CompileCWithGhc) ? arg "-optc-fsanitize=address", + builder (Ghc CompileCppWithGhc) ? arg "-optcxx-fsanitize=address", + builder (Ghc LinkHs) + ? arg "-optc-fsanitize=address" + <> arg "-optl-fsanitize=address" + <> (needSharedLibSAN ? arg "-optl-shared-libsan"), + builder (Cc CompileC) ? arg "-fsanitize=address", + builder Testsuite ? arg "--config=have_asan=True" + ] + -- | Use the LLVM backend in stages 1 and later. viaLlvmBackend :: Flavour -> Flavour viaLlvmBackend = addArgs $ notStage0 ? builder Ghc ? arg "-fllvm" ===================================== rts/include/Stg.h ===================================== @@ -335,6 +335,7 @@ external prototype return neither of these types to workaround #11395. #include "stg/MachRegsForHost.h" #include "stg/Regs.h" #include "stg/Ticky.h" +#include "rts/ASANUtils.h" #include "rts/TSANUtils.h" #if IN_STG_CODE ===================================== rts/include/rts/ASANUtils.h ===================================== @@ -0,0 +1,33 @@ +#pragma once + +#if defined(__SANITIZE_ADDRESS__) +#define ASAN_ENABLED +#elif defined(__has_feature) +#if __has_feature(address_sanitizer) +#define ASAN_ENABLED +#endif +#endif + +#if defined(ASAN_ENABLED) +#include <sanitizer/asan_interface.h> +#define USED_IF_ASAN +#else +#include <stdlib.h> +#define USED_IF_ASAN __attribute__((unused)) +#endif + +static inline void +__ghc_asan_poison_memory_region(void const volatile *addr USED_IF_ASAN, + size_t size USED_IF_ASAN) { +#if defined(ASAN_ENABLED) + __asan_poison_memory_region(addr, size); +#endif +} + +static inline void +__ghc_asan_unpoison_memory_region(void const volatile *addr USED_IF_ASAN, + size_t size USED_IF_ASAN) { +#if defined(ASAN_ENABLED) + __asan_unpoison_memory_region(addr, size); +#endif +} ===================================== rts/rts.cabal ===================================== @@ -97,6 +97,12 @@ flag ubsan UndefinedBehaviorSanitizer. default: False manual: True +flag asan + description: + Link with -fsanitize=address, to be enabled when building with + AddressSanitizer. + default: False + manual: True flag shared-libsan description: Link with -shared-libsan, to guarantee only one copy of the @@ -216,6 +222,9 @@ library if flag(ubsan) ld-options: -fsanitize=undefined + if flag(asan) + ld-options: -fsanitize=address + if flag(shared-libsan) ld-options: -shared-libsan @@ -280,6 +289,7 @@ library -- ^ generated rts/ghc_ffi.h rts/Adjustor.h + rts/ASANUtils.h rts/ExecPage.h rts/BlockSignals.h rts/Bytecodes.h ===================================== rts/sm/MBlock.c ===================================== @@ -579,6 +579,8 @@ getMBlocks(uint32_t n) ret = getCommittedMBlocks(n); + __ghc_asan_unpoison_memory_region(ret, (W_)n * MBLOCK_SIZE); + debugTrace(DEBUG_gc, "allocated %d megablock(s) at %p",n,ret); mblocks_allocated += n; @@ -611,6 +613,8 @@ freeMBlocks(void *addr, uint32_t n) mblocks_allocated -= n; + __ghc_asan_poison_memory_region(addr, (W_)n * MBLOCK_SIZE); + decommitMBlocks(addr, n); } ===================================== testsuite/driver/testglobals.py ===================================== @@ -189,6 +189,9 @@ class TestConfig: # Are we running with UndefinedBehaviorSanitizer enabled? self.have_ubsan = False + # Are we running with AddressSanitizer enabled? + self.have_asan = False + # Do symbols use leading underscores? self.leading_underscore = False ===================================== testsuite/driver/testlib.py ===================================== @@ -1093,6 +1093,9 @@ def have_thread_sanitizer( ) -> bool: def have_ubsan( ) -> bool: return config.have_ubsan +def have_asan( ) -> bool: + return config.have_asan + def gcc_as_cmmp() -> bool: return config.cmm_cpp_is_gcc ===================================== testsuite/tests/ffi/should_run/all.T ===================================== @@ -192,6 +192,9 @@ test('rts_clearMemory', [ extra_ways(['g1', 'nursery_chunks', 'nonmoving', 'compacting_gc', 'sanity']), # On windows, nonmoving way fails with bad exit code (2816) when(opsys('mingw32'), fragile(23091)), + # For simplicity, ASAN poisoning/unpoisoning logic is omitted + # from rts_clearMemory implementation + when(have_asan(), skip), req_c, pre_cmd('$MAKE -s --no-print-directory rts_clearMemory_setup') ], # Same hack as ffi023 ===================================== testsuite/tests/rts/T18623/all.T ===================================== @@ -8,6 +8,8 @@ test('T18623', # Recent versions of osx report an error when running `ulimit -v` when(opsys('darwin'), skip), when(arch('powerpc64le'), skip), + # ASan can't allocate shadow memory + when(have_asan(), skip), cmd_prefix('ulimit -v ' + str(8 * 1024 ** 2) + ' && '), ignore_stdout], run_command, ===================================== testsuite/tests/rts/all.T ===================================== @@ -105,6 +105,8 @@ def remove_parenthesis(s): return re.sub(r'\s+$[^)]*$', '', s) test('outofmem', [ when(opsys('darwin'), skip), + # ASan shadow memory allocation blows up + when(have_asan(), skip), # this is believed to cause other processes to die # that happen concurrently while the outofmem test # runs in CI. As such we'll need to disable it on View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/d43effd35213d7bade9b20701ccfa8… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/d43effd35213d7bade9b20701ccfa8… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/ghc-9.14-final] 3 commits: docs: note #26543 in known bugs
by Zubin (＠wz1000) 17 Dec '25

17 Dec '25

Zubin pushed to branch wip/ghc-9.14-final at Glasgow Haskell Compiler / GHC Commits: ebc6d49b by Zubin Duggal at 2025-12-17T20:07:36+05:30 docs: note #26543 in known bugs - - - - - 767ab0a6 by Zubin Duggal at 2025-12-17T20:07:36+05:30 rel-notes: updates for final 9.14.1 release - - - - - b75850af by Zubin Duggal at 2025-12-17T20:07:36+05:30 Prepare final 9.14.1 release - - - - - 3 changed files: - configure.ac - docs/users_guide/9.14.1-notes.rst - docs/users_guide/bugs.rst Changes: ===================================== configure.ac ===================================== @@ -22,7 +22,7 @@ AC_INIT([The Glorious Glasgow Haskell Compilation System], [9.14.0], [glasgow-ha AC_CONFIG_MACRO_DIRS([m4]) # Set this to YES for a released version, otherwise NO -: ${RELEASE=NO} +: ${RELEASE=YES} # The primary version (e.g. 7.5, 7.4.1) is set in the AC_INIT line # above. If this is not a released version, then we will append the ===================================== docs/users_guide/9.14.1-notes.rst ===================================== @@ -110,6 +110,9 @@ Language - Explicit level import support, allowing ``import`` declarations to explicitly state which compilation stages they are are visible to. +- Fix handling of tabs in string gaps (:ghc-ticket:`26415`). Tabs are now + correctly treated as whitespace in string gaps, matching the Haskell Report. + Compiler ~~~~~~~~ @@ -160,6 +163,23 @@ Compiler - Initial native code generator support for the LoongArch CPU architecture. +- Several fixes to :extension:`DeepSubsumption` type checking, improving handling + of higher-rank types in various contexts (:ghc-ticket:`26225`, :ghc-ticket:`26255`, + :ghc-ticket:`26277`, :ghc-ticket:`26331`, :ghc-ticket:`26332`). + +- Fix a scoping error in the Specialiser that could cause incorrect code generation + with :ghc-flag:`-fpolymorphic-specialisation` (:ghc-ticket:`26329`). + +- Fix a long-standing bug in the coercion optimiser that could produce invalid + coercions for ``ForAllCo`` (:ghc-ticket:`26345`). + +- Fix the type-family occurs check in unification (:ghc-ticket:`26457`). + +- Fix solving of forall-constraints (quantified constraints) to avoid infinite + loops in certain cases (:ghc-ticket:`26314`, :ghc-ticket:`26315`, :ghc-ticket:`26376`). + +- Fix reporting of redundant constraints on default-method declarations + (:ghc-ticket:`25992`). GHCi ~~~~ @@ -188,6 +208,12 @@ GHCi debugging clients * Internal refactorings towards making the debugger multi-thread aware (:ghc-ticket:`26064`) +- Fix bytecode generation for unsaturated applications of data constructor + workers (:ghc-ticket:`23210`). + +- Fix bytecode to use 32 bits for breakpoint indices, allowing more breakpoints + in large modules (:ghc-ticket:`26325`). + WebAssembly backend ~~~~~~~~~~~~~~~~~~~ @@ -201,6 +227,18 @@ See the blog post on `Tweag's blog <https://www.tweag.io/blog/2025-04-17-wasm-ghci-browser/>`_ for more information. +- Fix handling of forward declared ``GOT.func`` items in the wasm dynamic + linker (:ghc-ticket:`26430`). + +- Fix ``setKeepCAFs()`` to be properly called during wasm GHCi initialization + (:ghc-ticket:`26106`). + +- Fix JSFFI initialization constructor code to avoid clashing with user-defined + main functions. + +- Improve error handling in the JavaScript linker when library directories + are misconfigured (:ghc-ticket:`26383`). + Runtime system ~~~~~~~~~~~~~~ @@ -212,17 +250,44 @@ Runtime system - Reorganise how certain symbols are linked to avoid a bootstrapping failure with the linker shipping newer macOS versions (:ghc-ticket:`26166`) +- Fix eager black holes handling: properly record mutated closures and fix + an incorrect assertion that could cause issues with multiple threads racing + to claim a black hole (:ghc-ticket:`26495`) + +- Fix the Windows runtime linker to copy DLL path strings before inserting + them into the cache, preventing use-after-free issues (:ghc-ticket:`26613`) + +- Fix lost wakeups in ``threadPaused`` for threads blocked on black holes, + which could cause hangs in concurrent programs (:ghc-ticket:`26324`). + +- Fix heap reservation logic on POSIX systems to avoid infinite loops when + the OS repeatedly returns low memory addresses (:ghc-ticket:`26151`). + +- Fix handling of ``WHITEHOLE`` closures in ``scavenge_one`` when using the + non-moving garbage collector (:ghc-ticket:`26204`). + +- Fix alignment for ``gen_workspace`` on s390x to allow bootstrap on that + platform (:ghc-ticket:`26334`). + +- Push the correct update frame type in ``stg_AP_STACK`` for eager black holes. + ``base`` library ~~~~~~~~~~~~~~~~ - Updated to `Unicode 17.0.0 <https://www.unicode.org/versions/Unicode17.0.0>`_. +- Removed unstable heap representation details from ``GHC.Exts`` (:ghc-ticket:`25110`). + ``ghc-prim`` library ~~~~~~~~~~~~~~~~~~~~ ``ghc-prim`` is now a legacy interface providing access to primitive operations and types which are now also exposed via the ``ghc-experimental`` package. +- A new primop ``annotateStack#`` has been added, allowing arbitrary data to be + pushed onto the call stack for later extraction when decoding stack traces + (:ghc-ticket:`26218`). + ``ghc`` library ~~~~~~~~~~~~~~~ @@ -263,6 +328,16 @@ and types which are now also exposed via the ``ghc-experimental`` package. reading of the relevant Closure attributes without reliance on incomplete selectors. +* Fix a race condition with profiling builds (:ghc-ticket:`15197`, :ghc-ticket:`26407`). + +* Fix stack decoding when using the profiled runtime (:ghc-ticket:`26507`). + +``ghc-internal`` library +~~~~~~~~~~~~~~~~~~~~~~~~ + +* Fix ``naturalAndNot`` for the ``NB``/``NS`` (native bignum) case + (:ghc-ticket:`26230`). + ``ghc-experimental`` library ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ ===================================== docs/users_guide/bugs.rst ===================================== @@ -701,6 +701,9 @@ Bugs in GHC - Because of a toolchain limitation we are unable to support full Unicode paths on Windows. On Windows we support up to Latin-1. See :ghc-ticket:`12971` for more. +- The typechecker might reject certain programs using the ``($)`` operator which + are accepted by using explicit parentheses. See :ghc-ticket:`26543` for details. + .. _bugs-ghci: Bugs in GHCi (the interactive GHC) View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/93e76ed80cdee548ef608a36b5bba4… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/93e76ed80cdee548ef608a36b5bba4… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/fix-26670] A very untidy, partial reorganization [COMPILES]
by recursion-ninja (＠recursion-ninja) 17 Dec '25

17 Dec '25

recursion-ninja pushed to branch wip/fix-26670 at Glasgow Haskell Compiler / GHC Commits: b57f032c by Recursion Ninja at 2025-12-17T09:20:10-05:00 A very untidy, partial reorganization [COMPILES] - - - - - 15 changed files: - compiler/GHC/Core/Opt/WorkWrap.hs - compiler/GHC/HsToCore.hs - compiler/GHC/HsToCore/Binds.hs - compiler/GHC/HsToCore/Quote.hs - compiler/GHC/Rename/Bind.hs - compiler/GHC/Tc/Deriv/Generics.hs - compiler/GHC/Tc/Gen/Arrow.hs - compiler/GHC/Tc/TyCl/Instance.hs - compiler/GHC/Tc/Utils/Instantiate.hs - + compiler/GHC/Types/Arity.hs - compiler/GHC/Types/Basic.hs - compiler/GHC/Types/Id/Info.hs - compiler/GHC/Types/InlinePragma.hs - compiler/Language/Haskell/Syntax/Binds.hs - compiler/ghc.cabal.in Changes: ===================================== compiler/GHC/Core/Opt/WorkWrap.hs ===================================== @@ -834,7 +834,7 @@ mkWWBindPair ww_opts fn_id fn_info fn_args fn_body work_uniq div _ -> inl_act wrap_prag srcTxt = SourceText $ fsLit "{-# INLINE" - work_prag = InlinePragma { inl_src = XInlinePragmaGhcRn srcTxt arity + work_prag = InlinePragma { inl_src = InlinePragmaGhcTag srcTxt arity , inl_inline = fn_inline_spec , inl_act = work_act , inl_rule = FunLike } @@ -901,7 +901,7 @@ mkStrWrapperInlinePrag :: InlinePragma (GhcPass p) -> [CoreRule] -> Arity -> Inl mkStrWrapperInlinePrag (InlinePragma { inl_inline = fn_inl , inl_act = fn_act , inl_rule = rule_info }) rules arity - = InlinePragma { inl_src = XInlinePragmaGhcRn srcTxt arity + = InlinePragma { inl_src = InlinePragmaGhcTag srcTxt arity , inl_inline = fn_inl -- See Note [Worker/wrapper for INLINABLE functions] ===================================== compiler/GHC/HsToCore.hs ===================================== @@ -77,6 +77,7 @@ import GHC.Utils.Logger import GHC.Types.Id import GHC.Types.Id.Info import GHC.Types.Id.Make ( mkRepPolyIdConcreteTyVars ) +import GHC.Types.InlinePragma ( alwaysInlinePragma ) import GHC.Types.ForeignStubs import GHC.Types.Avail import GHC.Types.Var.Set ===================================== compiler/GHC/HsToCore/Binds.hs ===================================== @@ -49,7 +49,6 @@ import GHC.Core.Opt.OccurAnal ( occurAnalyseExpr ) import GHC.Core.InstEnv ( CanonicalEvidence(..) ) import GHC.Core.Make import GHC.Core.Utils -import GHC.Core.Opt.Arity ( etaExpand ) import GHC.Core.Unfold.Make import GHC.Core.FVs import GHC.Core.Predicate ===================================== compiler/GHC/HsToCore/Quote.hs ===================================== @@ -1097,7 +1097,7 @@ rep_wc_ty_sig mk_sig loc sig_ty nm = rep_ty_sig mk_sig loc (hswc_body sig_ty) nm rep_inline :: LocatedN Name - -> InlinePragma -- Never defaultInlinePragma + -> InlinePragma GhcRn -- Never defaultInlinePragma -> SrcSpan -> MetaM [(SrcSpan, Core (M TH.Dec))] rep_inline nm ispec loc @@ -1116,7 +1116,7 @@ rep_inline nm ispec loc ; return [(loc, pragma)] } -rep_inline_phases :: InlinePragma -> MetaM (Maybe (Core TH.Inline), Core TH.Phases) +rep_inline_phases :: InlinePragma GhcRn -> MetaM (Maybe (Core TH.Inline), Core TH.Phases) rep_inline_phases (InlinePragma { inl_act = act, inl_inline = inl }) = do { phases <- repPhases act ; inl <- if noUserInlineSpec inl @@ -1126,7 +1126,7 @@ rep_inline_phases (InlinePragma { inl_act = act, inl_inline = inl }) else Just <$> repInline inl ; return (inl, phases) } -rep_specialise :: LocatedN Name -> LHsSigType GhcRn -> InlinePragma +rep_specialise :: LocatedN Name -> LHsSigType GhcRn -> InlinePragma GhcRn -> SrcSpan -> MetaM [(SrcSpan, Core (M TH.Dec))] rep_specialise nm ty ispec loc @@ -1138,7 +1138,7 @@ rep_specialise nm ty ispec loc ; return [(loc, pragma)] } -rep_specialiseE :: RuleBndrs GhcRn -> LHsExpr GhcRn -> InlinePragma +rep_specialiseE :: RuleBndrs GhcRn -> LHsExpr GhcRn -> InlinePragma GhcRn -> MetaM (Core (M TH.Dec)) rep_specialiseE bndrs e ispec -- New form SPECIALISE pragmas ===================================== compiler/GHC/Rename/Bind.hs ===================================== @@ -1111,15 +1111,15 @@ renameSig ctxt sig@(SpecSig _ v tys inl) ; return ( new_ty:tys, fvs_ty `plusFV` fvs) } renameSig _ctxt (SpecSigE _ bndrs spec_e inl) - = do { (fn_rdr <- checkSpecESigShape spec_e - ; (fn_name <- lookupOccRn WL_TermVariable fn_rdr -- Checks that the head isn't forall-bound + = do { fn_rdr <- checkSpecESigShape spec_e + ; fn_name <- lookupOccRn WL_TermVariable fn_rdr -- Checks that the head isn't forall-bound ; bindRuleBndrs (SpecECtx fn_rdr) bndrs $ \_ bndrs' -> do { (spec_e', fvs) <- rnLExpr spec_e - ; return (SpecSigE fn_name bndrs' spec_e' ( inl), fvs) } } + ; return (SpecSigE fn_name bndrs' spec_e' ( inl `setInlinePragmaArity` 0), fvs) } } -- TODO: setting arity to 0 is likely wrong renameSig ctxt sig@(InlineSig _ v s) = do { new_v <- lookupSigOccRn ctxt sig v - ; return (InlineSig noAnn new_v s, emptyFVs) } + ; return (InlineSig noAnn new_v ( s `setInlinePragmaArity` 0 ), emptyFVs) } -- TODO: setting arity to 0 is likely wrong renameSig ctxt (FixSig _ fsig) = do { new_fsig <- rnSrcFixityDecl ctxt fsig ===================================== compiler/GHC/Tc/Deriv/Generics.hs ===================================== @@ -42,6 +42,7 @@ import GHC.Unit.Module ( moduleName, moduleUnit import GHC.Iface.Env ( newGlobalBinder ) +import GHC.Types.InlinePragma ( alwaysInlinePragma ) import GHC.Types.Name hiding ( varName ) import GHC.Types.Name.Reader import GHC.Types.SrcLoc ===================================== compiler/GHC/Tc/Gen/Arrow.hs ===================================== @@ -34,6 +34,7 @@ import GHC.Tc.Types.Origin import GHC.Tc.Types.Evidence import GHC.Core.Multiplicity import GHC.Core.Coercion +import GHC.Types.Arity ( Arity ) import GHC.Types.Id( mkLocalId ) import GHC.Tc.Utils.Instantiate import GHC.Builtin.Types ===================================== compiler/GHC/Tc/TyCl/Instance.hs ===================================== @@ -73,6 +73,8 @@ import GHC.Types.Var.Env import GHC.Types.Var.Set import GHC.Types.Basic import GHC.Types.Id +import GHC.Types.Id.Info (arityInfo) +import GHC.Types.InlinePragma import GHC.Types.SourceFile import GHC.Types.SourceText import GHC.Types.Name @@ -1430,11 +1432,12 @@ addDFunPrags :: DFunId -> [Id] -> DFunId -- is messing with. addDFunPrags dfun_id sc_meth_ids = dfun_id `setIdUnfolding` mkDFunUnfolding dfun_bndrs dict_con dict_args - `setInlinePragma` dfunInlinePragma + `setInlinePragma` (dfunInlinePragma `setInlinePragmaArity` arity) -- NOTE: Check if this arity calculation is correct -- NB: mkDFunUnfolding takes care of unary classes where - dict_args = map Type inst_tys ++ - [mkVarApps (Var id) dfun_bndrs | id <- sc_meth_ids] + arity = length var_apps + dict_args = map Type inst_tys ++ var_apps + var_apps = [mkVarApps (Var id) dfun_bndrs | id <- sc_meth_ids] (dfun_tvs, dfun_theta, clas, inst_tys) = tcSplitDFunTy (idType dfun_id) ev_ids = mkTemplateLocalsNum 1 dfun_theta @@ -2266,7 +2269,8 @@ mkDefMethBind :: SrcSpan -> DFunId -> Class -> Id -> Name mkDefMethBind loc dfun_id clas sel_id dm_name dm_spec = do { logger <- getLogger ; dm_id <- tcLookupId dm_name - ; let inline_prag = idInlinePragma dm_id + ; let inline_prag :: InlinePragma GhcRn + inline_prag = demoteInlinePragmaRn $ idInlinePragma dm_id inline_prags | isAnyInlinePragma inline_prag = [noLocA (InlineSig noAnn fn inline_prag)] | otherwise @@ -2668,9 +2672,11 @@ tcSpecInstPrags dfun_id (InstBindings { ib_binds = binds, ib_pragmas = uprags }) tcSpecInst :: Id -> Sig GhcRn -> TcM TcSpecPrag tcSpecInst dfun_id prag@(SpecInstSig _ hs_ty) = addErrCtxt (SpecPragmaCtxt prag) $ - do { spec_dfun_ty <- tcHsClsInstType SpecInstCtxt hs_ty - ; co_fn <- tcSpecWrapper SpecInstCtxt (idType dfun_id) spec_dfun_ty - ; return (SpecPrag dfun_id co_fn defaultInlinePragma) } + let arity = arityInfo $ idInfo dfun_id + prag = defaultInlinePragma `setInlinePragmaArity` arity + in do { spec_dfun_ty <- tcHsClsInstType SpecInstCtxt hs_ty + ; co_fn <- tcSpecWrapper SpecInstCtxt (idType dfun_id) spec_dfun_ty + ; return (SpecPrag dfun_id co_fn prag) } tcSpecInst _ _ = panic "tcSpecInst" ===================================== compiler/GHC/Tc/Utils/Instantiate.hs ===================================== @@ -74,7 +74,8 @@ import GHC.Tc.Zonk.Monad ( ZonkM ) import GHC.Rename.Utils( mkRnSyntaxExpr ) import GHC.Types.Id.Make( mkDictFunId ) -import GHC.Types.Basic ( TypeOrKind(..), VisArity ) +import GHC.Types.Arity ( Arity, VisArity ) +import GHC.Types.Basic ( TypeOrKind(..) ) import GHC.Types.SourceText import GHC.Types.SrcLoc as SrcLoc import GHC.Types.Var.Env ===================================== compiler/GHC/Types/Arity.hs ===================================== @@ -0,0 +1,129 @@ +{- +(c) The University of Glasgow 2006 +(c) The GRASP/AQUA Project, Glasgow University, 1997-1998 + +\section[BasicTypes]{Miscellaneous types} + +This module defines a miscellaneously collection of very simple +types that + +\begin{itemize} +\item have no other obvious home +\item don't depend on any other complicated types +\item are used in more than one "part" of the compiler +\end{itemize} +-} + +module GHC.Types.Arity + ( Arity + , VisArity + , RepArity + , JoinArity + , FullArgCount + ) where + +import GHC.Prelude + +{- +************************************************************************ +* * +\subsection[Arity]{Arity} +* * +************************************************************************ +-} + +-- | The number of value arguments that can be applied to a value before it does +-- "real work". So: +-- fib 100 has arity 0 +-- \x -> fib x has arity 1 +-- See also Note [Definition of arity] in "GHC.Core.Opt.Arity" +type Arity = Int + +-- | Syntactic (visibility) arity, i.e. the number of visible arguments. +-- See Note [Visibility and arity] +type VisArity = Int + +-- | Representation Arity +-- +-- The number of represented arguments that can be applied to a value before it does +-- "real work". So: +-- fib 100 has representation arity 0 +-- \x -> fib x has representation arity 1 +-- \(# x, y #) -> fib (x + y) has representation arity 2 +type RepArity = Int + +-- | The number of arguments that a join point takes. Unlike the arity of a +-- function, this is a purely syntactic property and is fixed when the join +-- point is created (or converted from a value). Both type and value arguments +-- are counted. +type JoinArity = Int + +-- | FullArgCount is the number of type or value arguments in an application, +-- or the number of type or value binders in a lambda. Note: it includes +-- both type and value arguments! +type FullArgCount = Int + +{- Note [Visibility and arity] +~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +Arity is the number of arguments that a function expects. In a curried language +like Haskell, there is more than one way to count those arguments. + +* `Arity` is the classic notion of arity, concerned with evalution, so it counts + the number of /value/ arguments that need to be supplied before evaluation can + take place, as described in notes + Note [Definition of arity] in GHC.Core.Opt.Arity + Note [Arity and function types] in GHC.Types.Id.Info + + Examples: + Int has arity == 0 + Int -> Int has arity <= 1 + Int -> Bool -> Int has arity <= 2 + We write (<=) rather than (==) as sometimes evaluation can occur before all + value arguments are supplied, depending on the actual function definition. + + This evaluation-focused notion of arity ignores type arguments, so: + forall a. a has arity == 0 + forall a. a -> a has arity <= 1 + forall a b. a -> b -> a has arity <= 2 + This is true regardless of ForAllTyFlag, so the arity is also unaffected by + (forall {a}. ty) or (forall a -> ty). + + Class dictionaries count towards the arity, as they are passed at runtime + forall a. (Num a) => a has arity <= 1 + forall a. (Num a) => a -> a has arity <= 2 + forall a b. (Num a, Ord b) => a -> b -> a has arity <= 4 + +* `VisArity` is the syntactic notion of arity. It is the number of /visible/ + arguments, i.e. arguments that occur visibly in the source code. + + In a function call `f x y z`, we can confidently say that f's vis-arity >= 3, + simply because we see three arguments [x,y,z]. We write (>=) rather than (==) + as this could be a partial application. + + At definition sites, we can acquire an underapproximation of vis-arity by + counting the patterns on the LHS, e.g. `f a b = rhs` has vis-arity >= 2. + The actual vis-arity can be higher if there is a lambda on the RHS, + e.g. `f a b = \c -> rhs`. + + If we look at the types, we can observe the following + * function arrows (a -> b) add to the vis-arity + * visible foralls (forall a -> b) add to the vis-arity + * constraint arrows (a => b) do not affect the vis-arity + * invisible foralls (forall a. b) do not affect the vis-arity + + This means that ForAllTyFlag matters for VisArity (in contrast to Arity), + while the type/value distinction is unimportant (again in contrast to Arity). + + Examples: + Int -- vis-arity == 0 (no args) + Int -> Int -- vis-arity == 1 (1 funarg) + forall a. a -> a -- vis-arity == 1 (1 funarg) + forall a. Num a => a -> a -- vis-arity == 1 (1 funarg) + forall a -> Num a => a -- vis-arity == 1 (1 req tyarg, 0 funargs) + forall a -> a -> a -- vis-arity == 2 (1 req tyarg, 1 funarg) + Int -> forall a -> Int -- vis-arity == 2 (1 funarg, 1 req tyarg) + + Wrinkle: with TypeApplications and TypeAbstractions, it is possible to visibly + bind and pass invisible arguments, e.g. `f @a x = ...` or `f @Int 42`. Those + @-prefixed arguments are ignored for the purposes of vis-arity. +-} ===================================== compiler/GHC/Types/Basic.hs ===================================== @@ -133,7 +133,7 @@ module GHC.Types.Basic ( ImportLevel(..), convImportLevel, convImportLevelSpec, allImportLevels, --- XInlinePragmaGhc(..) +-- InlinePragmaGhcTag(..) ) where import GHC.Prelude @@ -143,6 +143,7 @@ import GHC.Data.FastString import GHC.Utils.Outputable import GHC.Utils.Panic import GHC.Utils.Binary +import GHC.Types.Arity import GHC.Types.SourceText import qualified GHC.LanguageExtensions as LangExt import {-# SOURCE #-} Language.Haskell.Syntax.Type (PromotionFlag(..), isPromoted) @@ -187,105 +188,6 @@ instance NFData LeftOrRight where rnf CLeft = () rnf CRight = () - - -{- -************************************************************************ -* * -\subsection[Arity]{Arity} -* * -************************************************************************ --} - --- | Syntactic (visibility) arity, i.e. the number of visible arguments. --- See Note [Visibility and arity] -type VisArity = Int - --- | Representation Arity --- --- The number of represented arguments that can be applied to a value before it does --- "real work". So: --- fib 100 has representation arity 0 --- \x -> fib x has representation arity 1 --- \(# x, y #) -> fib (x + y) has representation arity 2 -type RepArity = Int - --- | The number of arguments that a join point takes. Unlike the arity of a --- function, this is a purely syntactic property and is fixed when the join --- point is created (or converted from a value). Both type and value arguments --- are counted. -type JoinArity = Int - --- | FullArgCount is the number of type or value arguments in an application, --- or the number of type or value binders in a lambda. Note: it includes --- both type and value arguments! -type FullArgCount = Int - -{- Note [Visibility and arity] -~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ -Arity is the number of arguments that a function expects. In a curried language -like Haskell, there is more than one way to count those arguments. - -* `Arity` is the classic notion of arity, concerned with evalution, so it counts - the number of /value/ arguments that need to be supplied before evaluation can - take place, as described in notes - Note [Definition of arity] in GHC.Core.Opt.Arity - Note [Arity and function types] in GHC.Types.Id.Info - - Examples: - Int has arity == 0 - Int -> Int has arity <= 1 - Int -> Bool -> Int has arity <= 2 - We write (<=) rather than (==) as sometimes evaluation can occur before all - value arguments are supplied, depending on the actual function definition. - - This evaluation-focused notion of arity ignores type arguments, so: - forall a. a has arity == 0 - forall a. a -> a has arity <= 1 - forall a b. a -> b -> a has arity <= 2 - This is true regardless of ForAllTyFlag, so the arity is also unaffected by - (forall {a}. ty) or (forall a -> ty). - - Class dictionaries count towards the arity, as they are passed at runtime - forall a. (Num a) => a has arity <= 1 - forall a. (Num a) => a -> a has arity <= 2 - forall a b. (Num a, Ord b) => a -> b -> a has arity <= 4 - -* `VisArity` is the syntactic notion of arity. It is the number of /visible/ - arguments, i.e. arguments that occur visibly in the source code. - - In a function call `f x y z`, we can confidently say that f's vis-arity >= 3, - simply because we see three arguments [x,y,z]. We write (>=) rather than (==) - as this could be a partial application. - - At definition sites, we can acquire an underapproximation of vis-arity by - counting the patterns on the LHS, e.g. `f a b = rhs` has vis-arity >= 2. - The actual vis-arity can be higher if there is a lambda on the RHS, - e.g. `f a b = \c -> rhs`. - - If we look at the types, we can observe the following - * function arrows (a -> b) add to the vis-arity - * visible foralls (forall a -> b) add to the vis-arity - * constraint arrows (a => b) do not affect the vis-arity - * invisible foralls (forall a. b) do not affect the vis-arity - - This means that ForAllTyFlag matters for VisArity (in contrast to Arity), - while the type/value distinction is unimportant (again in contrast to Arity). - - Examples: - Int -- vis-arity == 0 (no args) - Int -> Int -- vis-arity == 1 (1 funarg) - forall a. a -> a -- vis-arity == 1 (1 funarg) - forall a. Num a => a -> a -- vis-arity == 1 (1 funarg) - forall a -> Num a => a -- vis-arity == 1 (1 req tyarg, 0 funargs) - forall a -> a -> a -- vis-arity == 2 (1 req tyarg, 1 funarg) - Int -> forall a -> Int -- vis-arity == 2 (1 funarg, 1 req tyarg) - - Wrinkle: with TypeApplications and TypeAbstractions, it is possible to visibly - bind and pass invisible arguments, e.g. `f @a x = ...` or `f @Int 42`. Those - @-prefixed arguments are ignored for the purposes of vis-arity. --} - {- ************************************************************************ * * @@ -1439,18 +1341,18 @@ failed Succeeded = False failed Failed = True {- -data XInlinePragmaGhc = XInlinePragmaGhcRn +data InlinePragmaGhcTag = InlinePragmaGhcTag { inl_ghcrn_src :: {-# UNPACK#-} !SourceText , inl_ghcrn_arity :: {-# UNPACK#-} !Arity } deriving (Eq, Data) -instance NFData XInlinePragmaGhc where - rnf (XInlinePragmaGhcRn s a) = rnf s `seq` rnf a `seq` () +instance NFData InlinePragmaGhcTag where + rnf (InlinePragmaGhcTag s a) = rnf s `seq` rnf a `seq` () type instance XInlinePragma GhcPs = SourceText -type instance XInlinePragma GhcRn = XInlinePragmaGhc -type instance XInlinePragma GhcTc = XInlinePragmaGhc +type instance XInlinePragma GhcRn = InlinePragmaGhcTag +type instance XInlinePragma GhcTc = InlinePragmaGhcTag type instance XXInlinePragma (GhcPass _) = DataConCantHappen defaultInlinePragma, alwaysInlinePragma, neverInlinePragma, dfunInlinePragma @@ -1474,7 +1376,7 @@ dfunInlinePragma = defaultInlinePragma { inl_act = AlwaysActive setInlinePragmaArity :: InlinePragma GhcPs -> Arity -> InlinePragma GhcTc setInlinePragmaArity prag@(InlinePragma { inl_src = srcTxt }) arity = - prag { inl_src = XInlinePragmaGhcRn srcTxt arity } + prag { inl_src = InlinePragmaGhcTag srcTxt arity } {- inlinePragmaSource :: forall p. IsPass p => InlinePragma (GhcPass p) -> SourceText @@ -2072,15 +1974,15 @@ instance Binary InlineSpec where instance Outputable (InlinePragma (GhcPass p)) where ppr = pprInline -instance Binary XInlinePragmaGhc where - put_ bh (XInlinePragmaGhcRn s a) = do +instance Binary InlinePragmaGhcTag where + put_ bh (InlinePragmaGhcTag s a) = do put_ bh s put_ bh a get bh = do s <- get bh a <- get bh - return (XInlinePragmaGhcRn s a) + return (InlinePragmaGhcTag s a) instance Binary (InlinePragma GhcPs) where put_ bh (InlinePragma s a b c) = do ===================================== compiler/GHC/Types/Id/Info.hs ===================================== @@ -564,11 +564,11 @@ setRuleInfo info sp = sp `seq` info { ruleInfo = sp } setInlinePragInfo :: forall p. IsPass p => IdInfo -> InlinePragma (GhcPass p) -> IdInfo setInlinePragInfo info pr@(InlinePragma { inl_src = src }) = pr `seq` info { inlinePragInfo = pr { inl_src = tag } } where - tag :: XInlinePragmaGhc + tag :: InlinePragmaGhcTag tag = case ghcPass @p of - GhcPs -> XInlinePragmaGhcRn (src :: SourceText) 0 - GhcRn -> (src :: XInlinePragmaGhc) - GhcTc -> (src :: XInlinePragmaGhc) + GhcPs -> InlinePragmaGhcTag (src :: SourceText) 0 + GhcRn -> (src :: InlinePragmaGhcTag) + GhcTc -> (src :: InlinePragmaGhcTag) setOccInfo :: IdInfo -> OccInfo -> IdInfo setOccInfo info oc = oc `seq` info { occInfo = oc } ===================================== compiler/GHC/Types/InlinePragma.hs ===================================== @@ -52,10 +52,13 @@ module GHC.Types.InlinePragma ( setInlinePragmaArity, unsetInlinePragmaArity, pprInline, pprInlineDebug, + + -- ** Pass conversions + demoteInlinePragmaRn, promoteInlinePragmaRn, -- ** Extensible record type for GhcRn & GhcTc - XInlinePragmaGhc(..) + InlinePragmaGhcTag(..) ) where import GHC.Prelude @@ -64,25 +67,26 @@ import GHC.Data.FastString import GHC.Hs.Extension import GHC.Utils.Outputable import GHC.Utils.Binary +import GHC.Types.Arity (Arity) import GHC.Types.SourceText -import Control.DeepSeq ( NFData(..) ) +import Control.DeepSeq (NFData(..)) import Data.Data import Language.Haskell.Syntax.Binds import Language.Haskell.Syntax.Extension -data XInlinePragmaGhc = XInlinePragmaGhcRn +data InlinePragmaGhcTag = InlinePragmaGhcTag { inl_ghcrn_src :: {-# UNPACK#-} !SourceText , inl_ghcrn_arity :: {-# UNPACK#-} !Arity } deriving (Eq, Data) -instance NFData XInlinePragmaGhc where - rnf (XInlinePragmaGhcRn s a) = rnf s `seq` rnf a `seq` () +instance NFData InlinePragmaGhcTag where + rnf (InlinePragmaGhcTag s a) = rnf s `seq` rnf a `seq` () type instance XInlinePragma GhcPs = SourceText -type instance XInlinePragma GhcRn = XInlinePragmaGhc -type instance XInlinePragma GhcTc = XInlinePragmaGhc +type instance XInlinePragma GhcRn = InlinePragmaGhcTag +type instance XInlinePragma GhcTc = InlinePragmaGhcTag type instance XXInlinePragma (GhcPass _) = DataConCantHappen defaultInlinePragma, alwaysInlinePragma, neverInlinePragma, dfunInlinePragma @@ -105,10 +109,10 @@ alwaysInlineConLikePragma = alwaysInlinePragma { inl_rule = ConLike } dfunInlinePragma = defaultInlinePragma { inl_act = AlwaysActive , inl_rule = ConLike } -setInlinePragmaArity :: forall p q. (IsPass p, XInlinePragma (GhcPass q) ~ XInlinePragmaGhc) +setInlinePragmaArity :: forall p q. (IsPass p, XInlinePragma (GhcPass q) ~ InlinePragmaGhcTag) => InlinePragma (GhcPass p) -> Arity -> InlinePragma (GhcPass q) setInlinePragmaArity prag arity = - prag { inl_src = XInlinePragmaGhcRn (inlinePragmaSource prag) arity } + prag { inl_src = InlinePragmaGhcTag (inlinePragmaSource prag) arity } unsetInlinePragmaArity :: forall p. IsPass p => InlinePragma (GhcPass p) -> InlinePragma GhcPs unsetInlinePragmaArity prag = @@ -126,6 +130,9 @@ inlinePragmaSource (InlinePragma { inl_src = src }) = srcTxt promoteInlinePragmaRn :: InlinePragma GhcRn -> InlinePragma GhcTc promoteInlinePragmaRn prag@(InlinePragma { inl_src = src }) = prag { inl_src = src } +demoteInlinePragmaRn :: InlinePragma GhcTc -> InlinePragma GhcRn +demoteInlinePragmaRn prag@(InlinePragma { inl_src = src }) = prag { inl_src = src } + -- | Outputs string for pragma name for any of INLINE/INLINABLE/NOINLINE. This -- differs from the Outputable instance for the InlineSpec type where the pragma -- name string as well as the accompanying SourceText (if any) is printed. @@ -238,54 +245,32 @@ instance Binary InlineSpec where instance Outputable (InlinePragma (GhcPass p)) where ppr = pprInline -instance Binary XInlinePragmaGhc where - put_ bh (XInlinePragmaGhcRn s a) = do - put_ bh s - put_ bh a - - get bh = do - s <- get bh - a <- get bh - return (XInlinePragmaGhcRn s a) - -instance Binary (InlinePragma GhcPs) where - put_ bh (InlinePragma s a b c) = do - put_ bh s - put_ bh a - put_ bh b - put_ bh c - - get bh = do - s <- get bh - a <- get bh - b <- get bh - c <- get bh - return (InlinePragma s a b c) - -instance Binary (InlinePragma GhcRn) where - put_ bh (InlinePragma s a b c) = do +instance Binary InlinePragmaGhcTag where + put_ bh (InlinePragmaGhcTag s a) = do put_ bh s put_ bh a - put_ bh b - put_ bh c get bh = do s <- get bh a <- get bh - b <- get bh - c <- get bh - return (InlinePragma s a b c) + return (InlinePragmaGhcTag s a) -instance Binary (InlinePragma GhcTc) where +instance forall p. IsPass p => Binary (InlinePragma (GhcPass p)) where put_ bh (InlinePragma s a b c) = do - put_ bh s put_ bh a put_ bh b put_ bh c + case ghcPass @p of + GhcPs -> put_ bh s + GhcRn -> put_ bh s + GhcTc -> put_ bh s get bh = do - s <- get bh a <- get bh b <- get bh c <- get bh + s <- case ghcPass @p of + GhcPs -> get bh + GhcRn -> get bh + GhcTc -> get bh return (InlinePragma s a b c) ===================================== compiler/Language/Haskell/Syntax/Binds.hs ===================================== @@ -556,13 +556,6 @@ data HsPatSynDir id | ImplicitBidirectional | ExplicitBidirectional (MatchGroup id (LHsExpr id)) --- | The number of value arguments that can be applied to a value before it does --- "real work". So: --- fib 100 has arity 0 --- \x -> fib x has arity 1 --- See also Note [Definition of arity] in "GHC.Core.Opt.Arity" -type Arity = Int - {- ************************************************************************ * * ===================================== compiler/ghc.cabal.in ===================================== @@ -902,6 +902,7 @@ Library GHC.Tc.Zonk.Type GHC.ThToHs GHC.Types.Annotations + GHC.Types.Arity GHC.Types.Avail GHC.Types.Basic GHC.Types.CompleteMatch View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/b57f032c0c205e4b6eed413dc84aa08… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/commit/b57f032c0c205e4b6eed413dc84aa08… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/ghc-9.14-final] 2 commits: rel-notes: updates for final 9.14.1 release
by Zubin (＠wz1000) 17 Dec '25

17 Dec '25

Zubin pushed to branch wip/ghc-9.14-final at Glasgow Haskell Compiler / GHC Commits: 88144cc4 by Zubin Duggal at 2025-12-17T19:47:43+05:30 rel-notes: updates for final 9.14.1 release - - - - - 93e76ed8 by Zubin Duggal at 2025-12-17T19:47:43+05:30 Prepare final 9.14.1 release - - - - - 2 changed files: - configure.ac - docs/users_guide/9.14.1-notes.rst Changes: ===================================== configure.ac ===================================== @@ -22,7 +22,7 @@ AC_INIT([The Glorious Glasgow Haskell Compilation System], [9.14.0], [glasgow-ha AC_CONFIG_MACRO_DIRS([m4]) # Set this to YES for a released version, otherwise NO -: ${RELEASE=NO} +: ${RELEASE=YES} # The primary version (e.g. 7.5, 7.4.1) is set in the AC_INIT line # above. If this is not a released version, then we will append the ===================================== docs/users_guide/9.14.1-notes.rst ===================================== @@ -110,6 +110,9 @@ Language - Explicit level import support, allowing ``import`` declarations to explicitly state which compilation stages they are are visible to. +- Fix handling of tabs in string gaps (:ghc-ticket:`26415`). Tabs are now + correctly treated as whitespace in string gaps, matching the Haskell Report. + Compiler ~~~~~~~~ @@ -160,6 +163,23 @@ Compiler - Initial native code generator support for the LoongArch CPU architecture. +- Several fixes to :extension:`DeepSubsumption` type checking, improving handling + of higher-rank types in various contexts (:ghc-ticket:`26225`, :ghc-ticket:`26255`, + :ghc-ticket:`26277`, :ghc-ticket:`26331`, :ghc-ticket:`26332`). + +- Fix a scoping error in the Specialiser that could cause incorrect code generation + with :ghc-flag:`-fpolymorphic-specialisation` (:ghc-ticket:`26329`). + +- Fix a long-standing bug in the coercion optimiser that could produce invalid + coercions for ``ForAllCo`` (:ghc-ticket:`26345`). + +- Fix the type-family occurs check in unification (:ghc-ticket:`26457`). + +- Fix solving of forall-constraints (quantified constraints) to avoid infinite + loops in certain cases (:ghc-ticket:`26314`, :ghc-ticket:`26315`, :ghc-ticket:`26376`). + +- Fix reporting of redundant constraints on default-method declarations + (:ghc-ticket:`25992`). GHCi ~~~~ @@ -188,6 +208,12 @@ GHCi debugging clients * Internal refactorings towards making the debugger multi-thread aware (:ghc-ticket:`26064`) +- Fix bytecode generation for unsaturated applications of data constructor + workers (:ghc-ticket:`23210`). + +- Fix bytecode to use 32 bits for breakpoint indices, allowing more breakpoints + in large modules (:ghc-ticket:`26325`). + WebAssembly backend ~~~~~~~~~~~~~~~~~~~ @@ -201,6 +227,18 @@ See the blog post on `Tweag's blog <https://www.tweag.io/blog/2025-04-17-wasm-ghci-browser/>`_ for more information. +- Fix handling of forward declared ``GOT.func`` items in the wasm dynamic + linker (:ghc-ticket:`26430`). + +- Fix ``setKeepCAFs()`` to be properly called during wasm GHCi initialization + (:ghc-ticket:`26106`). + +- Fix JSFFI initialization constructor code to avoid clashing with user-defined + main functions. + +- Improve error handling in the JavaScript linker when library directories + are misconfigured (:ghc-ticket:`26383`). + Runtime system ~~~~~~~~~~~~~~ @@ -212,17 +250,44 @@ Runtime system - Reorganise how certain symbols are linked to avoid a bootstrapping failure with the linker shipping newer macOS versions (:ghc-ticket:`26166`) +- Fix eager black holes handling: properly record mutated closures and fix + an incorrect assertion that could cause issues with multiple threads racing + to claim a black hole (:ghc-ticket:`26495`) + +- Fix the Windows runtime linker to copy DLL path strings before inserting + them into the cache, preventing use-after-free issues (:ghc-ticket:`26613`) + +- Fix lost wakeups in ``threadPaused`` for threads blocked on black holes, + which could cause hangs in concurrent programs (:ghc-ticket:`26324`). + +- Fix heap reservation logic on POSIX systems to avoid infinite loops when + the OS repeatedly returns low memory addresses (:ghc-ticket:`26151`). + +- Fix handling of ``WHITEHOLE`` closures in ``scavenge_one`` when using the + non-moving garbage collector (:ghc-ticket:`26204`). + +- Fix alignment for ``gen_workspace`` on s390x to allow bootstrap on that + platform (:ghc-ticket:`26334`). + +- Push the correct update frame type in ``stg_AP_STACK`` for eager black holes. + ``base`` library ~~~~~~~~~~~~~~~~ - Updated to `Unicode 17.0.0 <https://www.unicode.org/versions/Unicode17.0.0>`_. +- Removed unstable heap representation details from ``GHC.Exts`` (:ghc-ticket:`25110`). + ``ghc-prim`` library ~~~~~~~~~~~~~~~~~~~~ ``ghc-prim`` is now a legacy interface providing access to primitive operations and types which are now also exposed via the ``ghc-experimental`` package. +- A new primop ``annotateStack#`` has been added, allowing arbitrary data to be + pushed onto the call stack for later extraction when decoding stack traces + (:ghc-ticket:`26218`). + ``ghc`` library ~~~~~~~~~~~~~~~ @@ -263,6 +328,16 @@ and types which are now also exposed via the ``ghc-experimental`` package. reading of the relevant Closure attributes without reliance on incomplete selectors. +* Fix a race condition with profiling builds (:ghc-ticket:`15197`, :ghc-ticket:`26407`). + +* Fix stack decoding when using the profiled runtime (:ghc-ticket:`26507`). + +``ghc-internal`` library +~~~~~~~~~~~~~~~~~~~~~~~~ + +* Fix ``naturalAndNot`` for the ``NB``/``NS`` (native bignum) case + (:ghc-ticket:`26230`). + ``ghc-experimental`` library ~~~~~~~~~~~~~~~~~~~~~~~~~~~~ View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/32f8a56b326f30541d1a9f6f5ea4c7… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/32f8a56b326f30541d1a9f6f5ea4c7… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc][wip/marge_bot_batch_merge_job] 11 commits: X86 CodeGen: fix assign_eax_sse_regs
by Marge Bot (＠marge-bot) 17 Dec '25

17 Dec '25

Marge Bot pushed to branch wip/marge_bot_batch_merge_job at Glasgow Haskell Compiler / GHC Commits: ca5c902f by sheaf at 2025-12-17T08:46:38-05:00 X86 CodeGen: fix assign_eax_sse_regs We must set %al to the number of SSE2 registers that contain arguments (in case we are dealing with a varargs function). The logic for counting how many arguments reside in SSE2 registers was incorrect, as it used 'isFloatFormat', which incorrectly ignores vector registers. We now instead do case analysis on the register class: is_sse_reg r = case targetClassOfReg platform r of RcFloatOrVector -> True RcInteger -> False This change is necessary to prevent segfaults in T20030_test1j, because subsequent commits change the format calculations, resulting in vector formats more often. - - - - - ba601f9b by sheaf at 2025-12-17T08:46:38-05:00 X86 regUsageOfInstr: fix format for IMUL When used with 8-bit operands, the IMUL instruction returns the result in the lower 16 bits of %rax (also known as %ax). This is different than for the other sizes, where an input at 16, 32 or 64 bits will result in 16, 32 or 64 bits of output in both %rax and %rdx. This doesn't affect the behaviour of the compiler, because we don't allow partial writes at sub-word sizes. The rationale is explained in Wrinkle [Don't allow scalar partial writes] in Note [Register formats in liveness analysis], in GHC.CmmToAsm.Reg.Liveness. - - - - - 90114349 by sheaf at 2025-12-17T08:46:38-05:00 Liveness analysis: consider register formats This commit updates the register allocator to be a bit more careful in situations in which a single register is used at multiple different formats, e.g. when xmm1 is used both to store a Double# and a DoubleX2#. This is done by introducing the 'Regs' newtype around 'UniqSet RegWithFormat', for which the combining operations take the larger of the two formats instead of overriding the format. Operations on 'Regs' are defined in 'GHC.CmmToAsm.Reg.Regs'. There is a modest compile-time cost for the additional overhead for tracking register formats, which causes the metric increases of this commit. The subtle aspects of the implementation are outlined in Note [Register formats in liveness analysis] in GHC.CmmToAsm.Reg.Liveness. Fixes #26411 #26611 ------------------------- Metric Increase: T12707 T26425 T3294 ------------------------- - - - - - bf43168f by sheaf at 2025-12-17T08:46:38-05:00 Register allocator: reload at same format as spill This commit ensures that if we spill a register onto the stack at a given format, we then always reload the register at this same format. This ensures we don't end up in a situation where we spill F64x2 but end up only reloading the lower F64. This first reload would make us believe the whole data is in a register, thus silently losing the upper 64 bits of the spilled register's contents. Fixes #26526 - - - - - 4237e52a by sheaf at 2025-12-17T08:46:38-05:00 Register allocation: writes redefine format As explained in Note [Allocated register formats] in GHC.CmmToAsm.Reg.Linear, we consider all writes to redefine the format of the register. This ensures that in a situation such as movsd .Ln6m(%rip),%v1 shufpd $0,%v1,%v1 we properly consider the broadcast operation to change the format of %v1 from F64 to F64x2. This completes the fix to #26411 (test in T26411b). - - - - - df5e42fc by Vladislav Zavialov at 2025-12-17T08:46:39-05:00 Parser: improve mkModuleImpExp, remove checkImportSpec 1. The `mkModuleImpExp` helper now knows whether it is processing an import or export list item, and uses this information to produce a more accurate error message for `import M (T(..,x))` with PatternSynonyms disabled. The old message incorrectly referred to this case as an export form. 2. The `checkImportSpec` helper is removed in favor of more comprehensive error checking in `mkModuleImpExp`. 3. Additionaly, the invariants of `ImpExpList` and `ImpExpAllWith` have been made more explicit in the comments and assertions (calls to 'panic'). Test case: import-syntax-no-ext - - - - - 92493eb2 by Vladislav Zavialov at 2025-12-17T08:46:40-05:00 Subordinate namespace-specified wildcards (#25901) Add support for subordinate namespace-specified wildcards `X(type ..)` and `X(data ..)` to import and export lists. Examples: import M (Cls(type ..)) -- imports Cls and all its associated types import M (Cls(data ..)) -- imports Cls and all its methods module M (R(data ..), C(type ..)) where -- exports R and all its data constructors and record fields; -- exports C and all its associated types, but not its methods The scope of this change is limited to the case where the wildcard is the only subordinate import/export item, whereas the more complex forms `X(type .., f)` or `X(type .., data ..)` are unsupported and raise the newly introduced PsErrUnsupportedExplicitNamespace error. This restriction may be lifted later. Summary of the changes: 1. Refactor IEThingAll to store its extension field XIEThingAll as a record IEThingAllExt instead of a tuple. 2. Extend the AST by adding a NamespaceSpecifier field to IEThingAllExt, representing an optional namespace specifier `type` or `data` in front of a subordinate wildcard `X(..)`. 3. Extend the grammar in Parser.y with productions for `type ..` and `data ..` in subordinate import/export items. 4. Introduce `filterByNamespaceGREs` to filter [GlobalRdrElt] by a NamespaceSpecifier; use it in `filterImports` and `exports_from_avail` to account for the namespace specifier in IEThingAll. 5. Improve diagnostics by storing more information in DodgyImportsEmptyParent and DodgyExportsEmptyParent. Test cases: T25901_sub_e T25901_sub_f T25901_sub_g T25901_sub_a T25901_sub_b T25901_sub_c T25901_sub_d T25901_sub_w DodgyImports02 DodgyImports03 DodgyImports04 - - - - - 83d927d3 by Cheng Shao at 2025-12-17T08:46:41-05:00 testsuite: improve coverage of foundation test This patch refactors the `foundation` test a bit to improve coverage: - Instead of using a hard-coded seed, a random seed is now taken from the command line, and printed upon test failure. This improves test coverage over many future CI runs, and shall a failure occur, the seed is available in the CI log for local reproduction. - The iterations count is bumped to 10000 instead of 100, similar to the bump in `test-primops`. Runtime timeout is bumped 2x just to be safe, though it's 2m39s on my machine and well within default timeout 300s. - Improve `newLCGGen` by using non-atomic loads/stores on a `MutableByteArray#` for storing mutable `Word64`, this test doesn't use parallelism in the first place - Fixed a few compiler warnings and removed redundant pragmas and imports Co-authored-by: Codex <codex(a)openai.com> - - - - - deff0f4d by Cheng Shao at 2025-12-17T08:46:43-05:00 rts: use __builtin_mul_overflow for hs_mulIntMayOflo This patch uses `__builtin_mul_overflow` to implement `hs_mulIntMayOflo`. This is a GNU C checked arithmetic builtin function supported by gcc/clang, is type-generic so works for both 32-bit/64-bit, and makes the code both more efficient and easier to read/maintain than the previous hand rolled logic. - - - - - e7db736b by Cheng Shao at 2025-12-17T08:46:45-05:00 compiler/rts: fix ABI mismatch in barf() invocations This patch fixes a long-standing issue of ABI mismatch in `barf()` invocations, both in compiler-emitted code and in hand written Cmm code: - In RTS, we have `barf()` which reports a fatal internal error message and exits the program. - `barf()` is a variadic C function! When used as a callee of a foreign call with `ccall` calling convention instead of `capi`, there is an ABI mismatch between the caller and the callee! - Unfortunately, both the compiler and the Cmm sources contain many places where we call `barf()` via `ccall` convention!! Like, when you write `foreign "C" barf("foo object (%p) entered!", R1)`, it totally doesn't do what you think it'll do at all!! The second argument `R1` is not properly passed in `va_list`, and the behavior is completely undefined!! - Even more unfortunately, this issue has been sitting around long enough because the ABI mismatch is subtle enough on normie platforms like x64 and arm64. - But there are platforms like wasm32 that are stricter about ABI, and the broken `barf()` invocations already causes trouble for wasm backend: we had to use ugly hacks like `barf(errmsg, NULL)` to make `wasm-ld` happy, and even with this band-aid, compiler-generated `barf()` invocations are still broken, resulting in regressions in certain debug-related functionality, e.g. `-dtag-inference-checks` is broken on wasm32 (#22882). This patch properly fixes the issue: - We add non-variadic `barf` wrappers in the RTS that can be used as `ccall` callees - Both the compiler `emitBarf` logic and the hand-written Cmm are changed to call these wrappers - `emitBarf` now also properly annotates the foreign call as `CmmNeverReturns` to indicate it's a noreturn call to enable more efficient code generation `-dtag-inference-checks` now works on wasm. Closes #22882. Co-authored-by: Codex <codex(a)openai.com> - - - - - d4fa9bfd by Vilim Lendvaj at 2025-12-17T08:46:50-05:00 Remove outdated comment The Traversable instance for ZipList is no longer in GHC.Internal.Data.Traversable. In fact, it is right below this very comment. - - - - - 91 changed files: - compiler/GHC/CmmToAsm/Reg/Graph.hs - compiler/GHC/CmmToAsm/Reg/Graph/Coalesce.hs - compiler/GHC/CmmToAsm/Reg/Graph/Spill.hs - compiler/GHC/CmmToAsm/Reg/Graph/SpillCost.hs - compiler/GHC/CmmToAsm/Reg/Linear.hs - compiler/GHC/CmmToAsm/Reg/Linear/Base.hs - compiler/GHC/CmmToAsm/Reg/Linear/JoinToTargets.hs - compiler/GHC/CmmToAsm/Reg/Liveness.hs - + compiler/GHC/CmmToAsm/Reg/Regs.hs - compiler/GHC/CmmToAsm/Reg/Target.hs - compiler/GHC/CmmToAsm/X86/CodeGen.hs - compiler/GHC/CmmToAsm/X86/Instr.hs - compiler/GHC/CmmToC.hs - compiler/GHC/Hs/Decls.hs - compiler/GHC/Hs/ImpExp.hs - compiler/GHC/Hs/Instances.hs - compiler/GHC/Parser.y - compiler/GHC/Parser/Errors/Ppr.hs - compiler/GHC/Parser/Errors/Types.hs - compiler/GHC/Parser/PostProcess.hs - compiler/GHC/Rename/Names.hs - compiler/GHC/StgToCmm/Bind.hs - compiler/GHC/StgToCmm/Utils.hs - compiler/GHC/Tc/Errors/Ppr.hs - compiler/GHC/Tc/Errors/Types.hs - compiler/GHC/Tc/Gen/Export.hs - compiler/GHC/Types/Error/Codes.hs - compiler/GHC/Types/Name/Reader.hs - compiler/GHC/Types/Unique/FM.hs - compiler/GHC/Types/Unique/Set.hs - compiler/ghc.cabal.in - libraries/ghc-internal/src/GHC/Internal/Functor/ZipList.hs - rts/Apply.cmm - rts/Compact.cmm - rts/ContinuationOps.cmm - rts/Exception.cmm - rts/Jumps.h - rts/PrimOps.cmm - rts/RtsMessages.c - rts/StgMiscClosures.cmm - rts/StgStartup.cmm - rts/include/Stg.h - rts/include/rts/Messages.h - rts/prim/mulIntMayOflo.c - testsuite/tests/haddock/should_compile_flag_haddock/T17544_kw.stderr - testsuite/tests/numeric/should_run/all.T - testsuite/tests/numeric/should_run/foundation.hs - testsuite/tests/numeric/should_run/foundation.stdout - testsuite/tests/patsyn/should_fail/all.T - + testsuite/tests/patsyn/should_fail/import-syntax-no-ext.hs - + testsuite/tests/patsyn/should_fail/import-syntax-no-ext.stderr - + testsuite/tests/rename/should_compile/T25901_sub_e.hs - + testsuite/tests/rename/should_compile/T25901_sub_f.hs - + testsuite/tests/rename/should_compile/T25901_sub_f.stderr - + testsuite/tests/rename/should_compile/T25901_sub_g.hs - + testsuite/tests/rename/should_compile/T25901_sub_g.stderr - + testsuite/tests/rename/should_compile/T25901_sub_g_helper.hs - testsuite/tests/rename/should_compile/all.T - testsuite/tests/rename/should_fail/T23570b.stderr - + testsuite/tests/rename/should_fail/T25901_sub_a.hs - + testsuite/tests/rename/should_fail/T25901_sub_a.stderr - + testsuite/tests/rename/should_fail/T25901_sub_b.hs - + testsuite/tests/rename/should_fail/T25901_sub_b.stderr - + testsuite/tests/rename/should_fail/T25901_sub_c.hs - + testsuite/tests/rename/should_fail/T25901_sub_c.stderr - + testsuite/tests/rename/should_fail/T25901_sub_c_helper.hs - + testsuite/tests/rename/should_fail/T25901_sub_d.hs - + testsuite/tests/rename/should_fail/T25901_sub_d.stderr - + testsuite/tests/rename/should_fail/T25901_sub_d_helper.hs - + testsuite/tests/rename/should_fail/T25901_sub_w.hs - + testsuite/tests/rename/should_fail/T25901_sub_w.stderr - testsuite/tests/rename/should_fail/all.T - + testsuite/tests/simd/should_run/T26411.hs - + testsuite/tests/simd/should_run/T26411.stdout - + testsuite/tests/simd/should_run/T26411b.hs - + testsuite/tests/simd/should_run/T26411b.stdout - testsuite/tests/simd/should_run/all.T - testsuite/tests/simplStg/should_compile/all.T - testsuite/tests/warnings/should_compile/DodgyExports03.stderr - testsuite/tests/warnings/should_compile/DodgyImports.stderr - + testsuite/tests/warnings/should_compile/DodgyImports02.hs - + testsuite/tests/warnings/should_compile/DodgyImports02.stderr - + testsuite/tests/warnings/should_compile/DodgyImports03.hs - + testsuite/tests/warnings/should_compile/DodgyImports03.stderr - + testsuite/tests/warnings/should_compile/DodgyImports03_helper.hs - + testsuite/tests/warnings/should_compile/DodgyImports04.hs - + testsuite/tests/warnings/should_compile/DodgyImports04.stderr - testsuite/tests/warnings/should_compile/DodgyImports_hiding.stderr - testsuite/tests/warnings/should_compile/all.T - utils/check-exact/ExactPrint.hs - utils/genapply/Main.hs The diff was not included because it is too large. View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/5f67d51e645a45f8409b40c2ffa6a0… -- View it on GitLab: https://gitlab.haskell.org/ghc/ghc/-/compare/5f67d51e645a45f8409b40c2ffa6a0… You're receiving this email because of your account on gitlab.haskell.org.

1 0

[Git][ghc/ghc] Pushed new branch wip/ghc-9.14-final
by Zubin (＠wz1000) 17 Dec '25

17 Dec '25

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

1 0