Skip to content
Snippets Groups Projects
  1. May 13, 2024
  2. May 10, 2024
  3. May 09, 2024
    • Ben Gamari's avatar
      Bump version to 9.10.1 · 017c52b7
      Ben Gamari authored
      017c52b7
    • Andrei Borzenkov's avatar
      Fix tuple puns renaming (24702) · 2cc6968a
      Andrei Borzenkov authored and Ben Gamari's avatar Ben Gamari committed
      Move tuple renaming short cutter from `isBuiltInOcc_maybe` to `isPunOcc_maybe`, so we consider incoming module.
      
      I also fixed some hidden bugs that raised after the change was done.
      
      (cherry picked from commit 94da9365)
      2cc6968a
    • Ryan Scott's avatar
      unboxedSum{Type,Data}Name: Use GHC.Types as the module · 78092043
      Ryan Scott authored
      Unboxed sum constructors are now defined in the `GHC.Types` module, so if you
      manually quote an unboxed sum (e.g., `''Sum2#`), you will get a `Name` like:
      
      ```hs
      GHC.Types.Sum2#
      ```
      
      The `unboxedSumTypeName` function in `template-haskell`, however, mistakenly
      believes that unboxed sum constructors are defined in `GHC.Prim`, so
      `unboxedSumTypeName 2` would return an entirely different `Name`:
      
      ```hs
      GHC.Prim.(#|#)
      ```
      
      This is a problem for Template Haskell users, as it means that they can't be
      sure which `Name` is the correct one. (Similarly for `unboxedSumDataName`.)
      
      This patch fixes the implementations of `unboxedSum{Type,Data}Name` to use
      `GHC.Types` as the module. For consistency with `unboxedTupleTypeName`, the
      `unboxedSumTypeName` function now uses the non-punned syntax for unboxed sums
      (`Sum<N>#`) as the `OccName`.
      
      Fixes #24750.
      78092043
    • Ben Gamari's avatar
      ghcup-metadata: Drop output_name · 923e21bc
      Ben Gamari authored
      This is entirely redundant to the filename of the URL. There is no
      compelling reason to name the downloaded file differently from its
      source.
      923e21bc
    • Ben Gamari's avatar
      Revert "ghcup-metadata: Drop output_name field" · c192d254
      Ben Gamari authored
      This reverts commit 250c5df7.
      c192d254
  4. May 08, 2024
  5. Apr 30, 2024
  6. Apr 26, 2024
  7. Apr 25, 2024
  8. Apr 24, 2024
    • Jade's avatar
      Put the newline after errors instead of before them · bcb5a91d
      Jade authored and Ben Gamari's avatar Ben Gamari committed
      This mainly has consequences for GHCi but also slightly alters how the
      output of GHC on the commandline looks.
      
      Fixes: #22499
      (cherry picked from commit 275e41a9)
      bcb5a91d
    • Simon Peyton Jones's avatar
      Clone CoVars in CorePrep · 1261ec2f
      Simon Peyton Jones authored and Ben Gamari's avatar Ben Gamari committed
      This MR addresses #24463.  It's all explained in the new
      
         Note [Cloning CoVars and TyVars]
      
      (cherry picked from commit 9d38bfa0)
      1261ec2f
    • Teo Camarasu's avatar
      Fix ghc API link in docs/index.html · 88e31848
      Teo Camarasu authored and Ben Gamari's avatar Ben Gamari committed
      This was missing part of the unit ID meaning it would 404.
      
      Resolves #24674
      
      (cherry picked from commit f30e4984)
      88e31848
    • Ben Gamari's avatar
      template-haskell: Declare TH.Lib.Internal as not-home · 6d6c2640
      Ben Gamari authored
      Rather than `hide`.
      
      Closes #24659.
      
      (cherry picked from commit d7a3d6b5)
      6d6c2640
    • Zubin's avatar
      driver: Make `checkHomeUnitsClosed` faster · b8f9880c
      Zubin authored
      The implementation of `checkHomeUnitsClosed` was traversing every single path
      in the unit dependency graph - this grows exponentially and quickly grows to be
      infeasible on larger unit dependency graphs.
      
      Instead we replace this with a faster implementation which follows from the
      specificiation of the closure property - there is a closure error if there are
      units which are both are both (transitively) depended upon by home units and
      (transitively) depend on home units, but are not themselves home units.
      
      To compute the set of units required for closure, we first compute the closure
      of the unit dependency graph, then the transpose of this closure, and find all
      units that are reachable from the home units in the transpose of the closure.
      
      (cherry picked from commit a933aff3)
      b8f9880c
Loading