HORIZON HASKELLDocslts/ghc-10.0.xaa25b892026-10-10Search names, modules, packages, or :: a typeCtrl K

GHC 10.0.0.20260917 · lts/ghc-10.0.x · aa25b89 · 2026-10-10

Moduleghc-lib-parser-9.14.1.20251220GHC2021

GHC.Unit.Home.PackageTable

The HomePackageTable (HPT) contains information about all modules that are part of a home package. At its core, the information for each module is a HomeModInfo.

During upsweep, the HPT is a monotonically increasing data structure: it only ever gets extended by inserting modules which are loaded and for which we discover the information required to construct a ModInfo.

There should only ever exist one single HPT for any given home unit. It's crucial we don't accidentally leak HPTs (e.g. by filtering it, which used to happen -- #25511), so the HPT is mutable and only its reference should be shared. This is alright because the modules don't change throughout compilation.

:::WARNING::: If you intend to change this interface, consider carefully whether you are exposing memory-leak footguns which may end up being misused in the compiler eventually. For instance, if you really, really, end up needing a way to take a snapshot of the IORef (think: do you really need to?), at least make obvious in the name like snapshotCopyHpt.

Or, do you really need a function to traverse all modules in the HPT? It is often better to keep the computation internal to this module, such as in hptCollectObjects...

  • 1 type
  • 19 values
newtypenewtype HomePackageTable
#

Helps us find information about modules in the home package

Constructors

  • HPT
    • table :: IORef (DModuleNameEnv HomeModInfo)

      Domain = modules in this home unit

      This is an IORef because we want to avoid leaking HPTs (see the particularly bad #25511). Moreover, the HPT invariant allows mutability in this table without compromising thread safety or soundness. To recall: A query to the HPT should depend only on data relevant to that query, such that there being more or less unrelated entries in the HPT does not influence the result in any way.

      Note that the HPT increases monotonically, except at certain barrier points like when restrictHpt is called. At these barriers, it is safe to temporarily violate the HPT monotonicity.

      The elements of this table may be updated (e.g. on rehydration).

Lookups in the HPT

2 declarations

Extending the HPT

2 declarations
valueaddHomeModInfoToHpt :: HomeModInfo -> HomePackageTable -> IO ()
#

Add a new module to the HPT.

An HPT is a monotonically increasing data structure, holding information about loaded modules in a package. This is the main function by which the HPT is extended or updated.

When the module of the inserted HomeModInfo does not exist, a new entry in the HPT is created for that module name. When the module already has an entry, inserting a new one entry in the HPT will always overwrite the existing entry for that module.

Restrict the HPT

1 declaration
valuerestrictHpt :: HomePackageTable -> [HomeModInfo] -> IO ()
#

Thin each HPT variable to only contain keys from the given dependencies. This is used at the end of upsweep to make sure that only completely successfully loaded modules are visible for subsequent operations.

This is an exception to the invariant of the HPT -- that it grows monotonically, never removing entries -- which is safe as long as it is only called at barrier points, such as the end of upsweep, when all threads are done and we want to clean up failed entries.

Queries about home modules

4 declarations

More Traversal-based queries

valuehptCollectDependencies
  1. :: HomePackageTable
  2. -> IO (Set (IfaceImportLevel, UnitId))
#

Collect the immediate dependencies of all modules in the HPT into a Set. The immediate dependencies are given by the iface as dep_direct_pkgs . mi_deps.

Note: This should be a query on the ModuleGraph, since we don't really ever want to collect *all* dependencies. The current caller of this function currently takes all dependencies only to then filter them with an ad-hoc transitive closure check. See #25639

Memory dangerous queries

valueconcatHpt :: (HomeModInfo -> [a]) -> HomePackageTable -> IO [a]
#

Like concatMap f . eltsHpt, but filters out all HomeModInfo for which f returns the empty list before doing the sort inherent to eltsUDFM.

If this function is ever exposed from the HPT module, make sure the argument function doesn't introduce leaks.

Utilities

1 declaration
valuepprHPT :: HomePackageTable -> IO SDoc
#

Pretty print a HomePackageTable.

Make sure you really do need to print the whole HPT before infusing too much code with IO.

For instance, in the HUG, it suffices to print the unit-keys present in the unit map in failed lookups.

Internals

2 declarations

These provide access to the internals of the HomePackageTable to facilitate existing workflows that used the previous API. For instance, if you were listing out all elements or merging, you can keep doing so by reading the internal IO ref and then using the moduleenv contents directly.

In GHC itself these should be avoided, and other uses should justify why it is not sufficient to go through the intended insert-only API.

Legacy API

2 declarations

This API is deprecated and meant to be removed.