Development.IDE.GHC.Compat.Core

Compat Core module that handles the GHC module hierarchy re-organisation by re-exporting everything we care about.

This module provides no other compat mechanisms, except for simple backward-compatible pattern synonyms.

Session

data DynFlags

Contains not only a collection of GeneralFlags but also a plethora of information relating to the compilation of a single file or GHC session

extensions :: DynFlags -> [OnOff Extension]

extensionFlags :: DynFlags -> EnumSet Extension

targetPlatform :: DynFlags -> Platform

packageFlags :: DynFlags -> [PackageFlag]

The -package and -hide-package flags from the command-line. In *reverse* order that they're specified on the command line.

generalFlags :: DynFlags -> EnumSet GeneralFlag

warningFlags :: DynFlags -> EnumSet WarningFlag

topDir :: DynFlags -> FilePath

hiDir :: DynFlags -> Maybe String

tmpDir :: DynFlags -> String

importPaths :: DynFlags -> [FilePath]

useColor :: DynFlags -> OverridingBool

canUseColor :: DynFlags -> Bool

useUnicode :: DynFlags -> Bool

objectDir :: DynFlags -> Maybe String

flagsForCompletion :: Bool -> [String]

Make a list of flags for shell completion. Filter all available flags into two groups, for interactive GHC vs all other.

setImportPaths :: [FilePath] -> DynFlags -> DynFlags

outputFile :: DynFlags -> Maybe String

pluginModNames :: DynFlags -> [ModuleName]

refLevelHoleFits :: DynFlags -> Maybe Int

Maximum level of refinement for refinement hole fits in typed hole error messages

maxRefHoleFits :: DynFlags -> Maybe Int

Maximum number of refinement hole fits to show in typed hole error messages

maxValidHoleFits :: DynFlags -> Maybe Int

Maximum number of hole fits to show in typed hole error messages

setOutputFile :: FilePath -> DynFlags -> DynFlags

lookupType :: HscEnv -> Name -> IO (Maybe TyThing)

Find the TyThing for the given Name by using all the resources at our disposal: the compiled modules in the HomePackageTable and the compiled modules in other packages that live in PackageTypeEnv. Note that this does NOT look up the TyThing in the module being compiled: you have to do that yourself, if desired

needWiredInHomeIface :: TyThing -> Bool

loadWiredInHomeIface :: Name -> IfM lcl ()

An IfM function to load the home interface for a wired-in thing, so that we're sure that we see its instance declarations and rules See Note [Loading instances for wired-in things]

loadSysInterface :: SDoc -> Module -> IfM lcl ModIface

Loads a system interface and throws an exception if it fails

importDecl :: Name -> IfM lcl (MaybeErr SDoc TyThing)

type CommandLineOption = String

Command line options gathered from the -PModule.Name:stuff syntax are given to you as this type

sPgm_F :: Settings -> String

settings :: DynFlags -> Settings

"unbuild" a Settings from a DynFlags. This shouldn't be needed in the vast majority of code. But GHCi questionably uses this to produce a default DynFlags from which to compute a flags diff for printing.

gopt :: GeneralFlag -> DynFlags -> Bool

Test whether a GeneralFlag is set

Note that dynamicNow (i.e., dynamic objects built with `-dynamic-too`) always implicitly enables Opt_PIC, Opt_ExternalDynamicRefs, and disables Opt_SplitSections.

gopt_set :: DynFlags -> GeneralFlag -> DynFlags

Set a GeneralFlag

gopt_unset :: DynFlags -> GeneralFlag -> DynFlags

Unset a GeneralFlag

wopt :: WarningFlag -> DynFlags -> Bool

Test whether a WarningFlag is set

wopt_set :: DynFlags -> WarningFlag -> DynFlags

Set a WarningFlag

xFlags :: [FlagSpec Extension]

These -Xblah flags can all be reversed with -XNoblah

xopt :: Extension -> DynFlags -> Bool

Test whether a Extension is set

xopt_unset :: DynFlags -> Extension -> DynFlags

Unset a Extension

xopt_set :: DynFlags -> Extension -> DynFlags

Set a Extension

data FlagSpec flag

Constructors

FlagSpec

Fields

• flagSpecName :: String

  Flag in string form

• flagSpecFlag :: flag

  Flag in internal form

• flagSpecAction :: TurnOnFlag -> DynP ()

  Extra action to run when the flag is found Typically, emit a warning or error

• flagSpecGhcMode :: GhcFlagMode

  In which ghc mode the flag has effect

data WarningFlag

Constructors

Opt_WarnDuplicateExports

Opt_WarnDuplicateConstraints

Opt_WarnRedundantConstraints

Opt_WarnHiShadows

Opt_WarnImplicitPrelude

Opt_WarnIncompletePatterns

Opt_WarnIncompleteUniPatterns

Opt_WarnIncompletePatternsRecUpd

Opt_WarnOverflowedLiterals

Opt_WarnEmptyEnumerations

Opt_WarnMissingFields

Opt_WarnMissingImportList

Opt_WarnMissingMethods

Opt_WarnMissingSignatures

Opt_WarnMissingLocalSignatures

Opt_WarnNameShadowing

Opt_WarnOverlappingPatterns

Opt_WarnTypeDefaults

Opt_WarnMonomorphism

Opt_WarnUnusedTopBinds

Opt_WarnUnusedLocalBinds

Opt_WarnUnusedPatternBinds

Opt_WarnUnusedImports

Opt_WarnUnusedMatches

Opt_WarnUnusedTypePatterns

Opt_WarnUnusedForalls

Opt_WarnUnusedRecordWildcards

Opt_WarnRedundantBangPatterns

Opt_WarnRedundantRecordWildcards

Opt_WarnWarningsDeprecations

Opt_WarnDeprecatedFlags

Opt_WarnMissingMonadFailInstances

Opt_WarnSemigroup

Opt_WarnDodgyExports

Opt_WarnDodgyImports

Opt_WarnOrphans

Opt_WarnAutoOrphans

Opt_WarnIdentities

Opt_WarnTabs

Opt_WarnUnrecognisedPragmas

Opt_WarnDodgyForeignImports

Opt_WarnUnusedDoBind

Opt_WarnWrongDoBind

Opt_WarnAlternativeLayoutRuleTransitional

Opt_WarnUnsafe

Opt_WarnSafe

Opt_WarnTrustworthySafe

Opt_WarnMissedSpecs

Opt_WarnAllMissedSpecs

Opt_WarnUnsupportedCallingConventions

Opt_WarnUnsupportedLlvmVersion

Opt_WarnMissedExtraSharedLib

Opt_WarnInlineRuleShadowing

Opt_WarnTypedHoles

Opt_WarnPartialTypeSignatures

Opt_WarnMissingExportedSignatures

Opt_WarnUntickedPromotedConstructors

Opt_WarnDerivingTypeable

Opt_WarnDeferredTypeErrors

Opt_WarnDeferredOutOfScopeVariables

Opt_WarnNonCanonicalMonadInstances

Opt_WarnNonCanonicalMonadFailInstances

Opt_WarnNonCanonicalMonoidInstances

Opt_WarnMissingPatternSynonymSignatures

Opt_WarnUnrecognisedWarningFlags

Opt_WarnSimplifiableClassConstraints

Opt_WarnCPPUndef

Opt_WarnUnbangedStrictPatterns

Opt_WarnMissingHomeModules

Opt_WarnPartialFields

Opt_WarnMissingExportList

Opt_WarnInaccessibleCode

Opt_WarnStarIsType

Opt_WarnStarBinder

Opt_WarnImplicitKindVars

Opt_WarnSpaceAfterBang

Opt_WarnMissingDerivingStrategies

Opt_WarnPrepositiveQualifiedModule

Opt_WarnUnusedPackages

Opt_WarnInferredSafeImports

Opt_WarnMissingSafeHaskellMode

Opt_WarnCompatUnqualifiedImports

Opt_WarnDerivingDefaults

Opt_WarnInvalidHaddock

Opt_WarnOperatorWhitespaceExtConflict

Opt_WarnOperatorWhitespace

Opt_WarnAmbiguousFields

Opt_WarnImplicitLift

Opt_WarnMissingKindSignatures

Opt_WarnUnicodeBidirectionalFormatCharacters

Instances

Enum WarningFlag

Defined in GHC.Driver.Flags

Methods

succ :: WarningFlag -> WarningFlag

pred :: WarningFlag -> WarningFlag

toEnum :: Int -> WarningFlag

fromEnum :: WarningFlag -> Int

enumFrom :: WarningFlag -> [WarningFlag]

enumFromThen :: WarningFlag -> WarningFlag -> [WarningFlag]

enumFromTo :: WarningFlag -> WarningFlag -> [WarningFlag]

enumFromThenTo :: WarningFlag -> WarningFlag -> WarningFlag -> [WarningFlag]

Show WarningFlag

Defined in GHC.Driver.Flags

Methods

showsPrec :: Int -> WarningFlag -> ShowS

show :: WarningFlag -> String

showList :: [WarningFlag] -> ShowS

Eq WarningFlag

Defined in GHC.Driver.Flags

Methods

(==) :: WarningFlag -> WarningFlag -> Bool

(/=) :: WarningFlag -> WarningFlag -> Bool

Ord WarningFlag

Defined in GHC.Driver.Flags

Methods

compare :: WarningFlag -> WarningFlag -> Ordering

(<) :: WarningFlag -> WarningFlag -> Bool

(<=) :: WarningFlag -> WarningFlag -> Bool

(>) :: WarningFlag -> WarningFlag -> Bool

(>=) :: WarningFlag -> WarningFlag -> Bool

max :: WarningFlag -> WarningFlag -> WarningFlag

min :: WarningFlag -> WarningFlag -> WarningFlag

data GeneralFlag

Enumerates the simple on-or-off dynamic flags

Constructors

Opt_DumpToFile

Append dump output to files instead of stdout.

Opt_D_faststring_stats

Opt_D_dump_minimal_imports

Opt_DoCoreLinting

Opt_DoLinearCoreLinting

Opt_DoStgLinting

Opt_DoCmmLinting

Opt_DoAsmLinting

Opt_DoAnnotationLinting

Opt_DoBoundsChecking

Opt_NoLlvmMangler

Opt_FastLlvm

Opt_NoTypeableBinds

Opt_DistinctConstructorTables

Opt_InfoTableMap

Opt_WarnIsError

Opt_ShowWarnGroups

Opt_HideSourcePaths

Opt_PrintExplicitForalls

Opt_PrintExplicitKinds

Opt_PrintExplicitCoercions

Opt_PrintExplicitRuntimeReps

Opt_PrintEqualityRelations

Opt_PrintAxiomIncomps

Opt_PrintUnicodeSyntax

Opt_PrintExpandedSynonyms

Opt_PrintPotentialInstances

Opt_PrintTypecheckerElaboration

Opt_CallArity

Opt_Exitification

Opt_Strictness

Opt_LateDmdAnal

Opt_KillAbsence

Opt_KillOneShot

Opt_FullLaziness

Opt_FloatIn

Opt_LateSpecialise

Opt_Specialise

Opt_SpecialiseAggressively

Opt_CrossModuleSpecialise

Opt_InlineGenerics

Opt_InlineGenericsAggressively

Opt_StaticArgumentTransformation

Opt_CSE

Opt_StgCSE

Opt_StgLiftLams

Opt_LiberateCase

Opt_SpecConstr

Opt_SpecConstrKeen

Opt_DoLambdaEtaExpansion

Opt_IgnoreAsserts

Opt_DoEtaReduction

Opt_CaseMerge

Opt_CaseFolding

Opt_UnboxStrictFields

Opt_UnboxSmallStrictFields

Opt_DictsCheap

Opt_EnableRewriteRules

Opt_EnableThSpliceWarnings

Opt_RegsGraph

Opt_RegsIterative

Opt_PedanticBottoms

Opt_LlvmTBAA

Opt_LlvmFillUndefWithGarbage

Opt_IrrefutableTuples

Opt_CmmSink

Opt_CmmStaticPred

Opt_CmmElimCommonBlocks

Opt_AsmShortcutting

Opt_OmitYields

Opt_FunToThunk

Opt_DictsStrict

Opt_DmdTxDictSel

deprecated, no effect and behaviour is now default. Allowed switching of a special demand transformer for dictionary selectors

Opt_Loopification

Opt_CfgBlocklayout

Use the cfg based block layout algorithm.

Opt_WeightlessBlocklayout

Layout based on last instruction per block.

Opt_CprAnal

Opt_WorkerWrapper

Opt_SolveConstantDicts

Opt_AlignmentSanitisation

Opt_CatchBottoms

Opt_NumConstantFolding

Opt_SimplPreInlining

Opt_IgnoreInterfacePragmas

Opt_OmitInterfacePragmas

Opt_ExposeAllUnfoldings

Opt_WriteInterface

Opt_WriteHie

Opt_AutoSccsOnIndividualCafs

Opt_ProfCountEntries

Opt_Pp

Opt_ForceRecomp

Opt_IgnoreOptimChanges

Opt_IgnoreHpcChanges

Opt_ExcessPrecision

Opt_EagerBlackHoling

Opt_NoHsMain

Opt_SplitSections

Opt_StgStats

Opt_HideAllPackages

Opt_HideAllPluginPackages

Opt_PrintBindResult

Opt_Haddock

Opt_HaddockOptions

Opt_BreakOnException

Opt_BreakOnError

Opt_PrintEvldWithShow

Opt_PrintBindContents

Opt_GenManifest

Opt_EmbedManifest

Opt_SharedImplib

Opt_BuildingCabalPackage

Opt_IgnoreDotGhci

Opt_GhciSandbox

Opt_GhciHistory

Opt_GhciLeakCheck

Opt_ValidateHie

Opt_LocalGhciHistory

Opt_NoIt

Opt_HelpfulErrors

Opt_DeferTypeErrors

Opt_DeferTypedHoles

Opt_DeferOutOfScopeVariables

Opt_PIC

-fPIC

Opt_PIE

-fPIE

Opt_PICExecutable

-pie

Opt_ExternalDynamicRefs

Opt_Ticky

Opt_Ticky_Allocd

Opt_Ticky_LNE

Opt_Ticky_Dyn_Thunk

Opt_RPath

Opt_RelativeDynlibPaths

Opt_CompactUnwind

-fcompact-unwind

Opt_Hpc

Opt_FamAppCache

Opt_ExternalInterpreter

Opt_OptimalApplicativeDo

Opt_VersionMacros

Opt_WholeArchiveHsLibs

Opt_SingleLibFolder

Opt_ExposeInternalSymbols

Opt_KeepCAFs

Opt_KeepGoing

Opt_ByteCode

Opt_LinkRts

Opt_ErrorSpans

Opt_DeferDiagnostics

Opt_DiagnosticsShowCaret

Opt_PprCaseAsLet

Opt_PprShowTicks

Opt_ShowHoleConstraints

Opt_ShowValidHoleFits

Opt_SortValidHoleFits

Opt_SortBySizeHoleFits

Opt_SortBySubsumHoleFits

Opt_AbstractRefHoleFits

Opt_UnclutterValidHoleFits

Opt_ShowTypeAppOfHoleFits

Opt_ShowTypeAppVarsOfHoleFits

Opt_ShowDocsOfHoleFits

Opt_ShowTypeOfHoleFits

Opt_ShowProvOfHoleFits

Opt_ShowMatchesOfHoleFits

Opt_ShowLoadedModules

Opt_HexWordLiterals

Opt_SuppressCoercions

Opt_SuppressVarKinds

Opt_SuppressModulePrefixes

Opt_SuppressTypeApplications

Opt_SuppressIdInfo

Opt_SuppressUnfoldings

Opt_SuppressTypeSignatures

Opt_SuppressUniques

Opt_SuppressStgExts

Opt_SuppressTicks

Opt_SuppressTimestamps

Suppress timestamps in dumps

Opt_AutoLinkPackages

Opt_ImplicitImportQualified

Opt_KeepHscppFiles

Opt_KeepHiDiffs

Opt_KeepHcFiles

Opt_KeepSFiles

Opt_KeepTmpFiles

Opt_KeepRawTokenStream

Opt_KeepLlvmFiles

Opt_KeepHiFiles

Opt_KeepOFiles

Opt_BuildDynamicToo

Opt_DistrustAllPackages

Opt_PackageTrust

Opt_PluginTrustworthy

Opt_G_NoStateHack

Opt_G_NoOptCoercion

Instances

Enum GeneralFlag

Defined in GHC.Driver.Flags

Methods

succ :: GeneralFlag -> GeneralFlag

pred :: GeneralFlag -> GeneralFlag

toEnum :: Int -> GeneralFlag

fromEnum :: GeneralFlag -> Int

enumFrom :: GeneralFlag -> [GeneralFlag]

enumFromThen :: GeneralFlag -> GeneralFlag -> [GeneralFlag]

enumFromTo :: GeneralFlag -> GeneralFlag -> [GeneralFlag]

enumFromThenTo :: GeneralFlag -> GeneralFlag -> GeneralFlag -> [GeneralFlag]

Show GeneralFlag

Defined in GHC.Driver.Flags

Methods

showsPrec :: Int -> GeneralFlag -> ShowS

show :: GeneralFlag -> String

showList :: [GeneralFlag] -> ShowS

Eq GeneralFlag

Defined in GHC.Driver.Flags

Methods

(==) :: GeneralFlag -> GeneralFlag -> Bool

(/=) :: GeneralFlag -> GeneralFlag -> Bool

data PackageFlag

Flags for manipulating packages visibility.

Instances

Show PackageFlag

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> PackageFlag -> ShowS

show :: PackageFlag -> String

showList :: [PackageFlag] -> ShowS

Outputable PackageFlag

Defined in GHC.Driver.Session

Methods

ppr :: PackageFlag -> SDoc

Eq PackageFlag

Defined in GHC.Driver.Session

Methods

(==) :: PackageFlag -> PackageFlag -> Bool

(/=) :: PackageFlag -> PackageFlag -> Bool

data PackageArg

We accept flags which make packages visible, but how they select the package varies; this data type reflects what selection criterion is used.

Constructors

PackageArg String

-package, by PackageName

UnitIdArg Unit

-package-id, by Unit

Instances

Show PackageArg

Defined in GHC.Driver.Session

Methods

showsPrec :: Int -> PackageArg -> ShowS

show :: PackageArg -> String

showList :: [PackageArg] -> ShowS

Outputable PackageArg

Defined in GHC.Driver.Session

Methods

ppr :: PackageArg -> SDoc

Eq PackageArg

Defined in GHC.Driver.Session

Methods

(==) :: PackageArg -> PackageArg -> Bool

(/=) :: PackageArg -> PackageArg -> Bool

data ModRenaming

Represents the renaming that may be associated with an exposed package, e.g. the rns part of -package "foo (rns)".

Here are some example parsings of the package flags (where a string literal is punned to be a ModuleName:

• -package foo is ModRenaming True []
• -package foo () is ModRenaming False []
• -package foo (A) is ModRenaming False [(A, A)]
• -package foo (A as B) is ModRenaming False [(A, B)]
• -package foo with (A as B) is ModRenaming True [(A, B)]

Constructors

ModRenaming

Fields

• modRenamingWithImplicit :: Bool

  Bring all exposed modules into scope?

• modRenamings :: [(ModuleName, ModuleName)]

  Bring module m into scope under name n.

Instances

Outputable ModRenaming

Defined in GHC.Driver.Session

Methods

ppr :: ModRenaming -> SDoc

Eq ModRenaming

Defined in GHC.Driver.Session

Methods

(==) :: ModRenaming -> ModRenaming -> Bool

(/=) :: ModRenaming -> ModRenaming -> Bool

pattern ExposePackage :: String -> PackageArg -> ModRenaming -> PackageFlag

parseDynamicFlagsCmdLine

Arguments

:: MonadIO m

=> DynFlags

-> [Located String]

-> m (DynFlags, [Located String], [Warn])

Updated DynFlags, left-over arguments, and list of warnings.

Parse dynamic flags from a list of command line arguments. Returns the parsed DynFlags, the left-over arguments, and a list of warnings. Throws a UsageError if errors occurred during parsing (such as unknown flags or missing arguments).

parseDynamicFilePragma

Arguments

:: MonadIO m

=> DynFlags

-> [Located String]

-> m (DynFlags, [Located String], [Warn])

Updated DynFlags, left-over arguments, and list of warnings.

Like parseDynamicFlagsCmdLine but does not allow the package flags (-package, -hide-package, -ignore-package, -hide-all-packages, -package-db). Used to parse flags set in a modules pragma.

data WarnReason

Used when outputting warnings: if a reason is given, it is displayed. If a warning isn't controlled by a flag, this is made explicit at the point of use.

Constructors

NoReason

Reason !WarningFlag

Warning was enabled with the flag

ErrReason !(Maybe WarningFlag)

Warning was made an error because of -Werror or -Werror=WarningFlag

Instances

Show WarnReason

Defined in GHC.Driver.Flags

Methods

showsPrec :: Int -> WarnReason -> ShowS

show :: WarnReason -> String

showList :: [WarnReason] -> ShowS

ToJson WarnReason

Defined in GHC.Driver.Flags

Methods

json :: WarnReason -> JsonDoc

Outputable WarnReason

Defined in GHC.Driver.Flags

Methods

ppr :: WarnReason -> SDoc

wWarningFlags :: [FlagSpec WarningFlag]

These -W<blah> flags can all be reversed with -Wno-<blah>

updOptLevel :: Int -> DynFlags -> DynFlags

Sets the DynFlags to be appropriate to the optimisation level

setUnsafeGlobalDynFlags :: DynFlags -> IO ()

Linear Haskell

scaledThing :: Scaled a -> a

Interface Files

type IfaceExport = AvailInfo

The original names declared of a certain module that are exported

data IfaceTyCon

Constructors

IfaceTyCon

Fields

• ifaceTyConName :: IfExtName
• ifaceTyConInfo :: IfaceTyConInfo

Instances

NFData IfaceTyCon

Defined in GHC.Iface.Type

Methods

rnf :: IfaceTyCon -> ()

Binary IfaceTyCon

Defined in GHC.Iface.Type

Methods

put_ :: BinHandle -> IfaceTyCon -> IO ()

put :: BinHandle -> IfaceTyCon -> IO (Bin IfaceTyCon)

get :: BinHandle -> IO IfaceTyCon

Outputable IfaceTyCon

Defined in GHC.Iface.Type

Methods

ppr :: IfaceTyCon -> SDoc

Eq IfaceTyCon

Defined in GHC.Iface.Type

Methods

(==) :: IfaceTyCon -> IfaceTyCon -> Bool

(/=) :: IfaceTyCon -> IfaceTyCon -> Bool

type ModIface = ModIface_ 'ModIfaceFinal

data ModIface_ (phase :: ModIfacePhase)

A ModIface_ plus a ModDetails summarises everything we know about a compiled module. The ModIface_ is the stuff *before* linking, and can be written out to an interface file. The 'ModDetails is after linking and can be completely recovered from just the ModIface_.

When we read an interface file, we also construct a ModIface_ from it, except that we explicitly make the mi_decls and a few other fields empty; as when reading we consolidate the declarations etc. into a number of indexed maps and environments in the ExternalPackageState.

Constructors

ModIface

Fields

• mi_module :: !Module

  Name of the module we are for

• mi_sig_of :: !(Maybe Module)

  Are we a sig of another mod?

• mi_hsc_src :: !HscSource

  Boot? Signature?

• mi_deps :: Dependencies

  The dependencies of the module. This is consulted for directly-imported modules, but not for anything else (hence lazy)

• mi_usages :: [Usage]

  Usages; kept sorted so that it's easy to decide whether to write a new iface file (changing usages doesn't affect the hash of this module) NOT STRICT! we read this field lazily from the interface file It is *only* consulted by the recompilation checker

• mi_exports :: ![IfaceExport]

  Exports Kept sorted by (mod,occ), to make version comparisons easier Records the modules that are the declaration points for things exported by this module, and the OccNames of those things

• mi_used_th :: !Bool

  Module required TH splices when it was compiled. This disables recompilation avoidance (see #481).

• mi_fixities :: [(OccName, Fixity)]

  Fixities NOT STRICT! we read this field lazily from the interface file

• mi_warns :: Warnings

  Warnings NOT STRICT! we read this field lazily from the interface file

• mi_anns :: [IfaceAnnotation]

  Annotations NOT STRICT! we read this field lazily from the interface file

• mi_decls :: [IfaceDeclExts phase]

  Type, class and variable declarations The hash of an Id changes if its fixity or deprecations change (as well as its type of course) Ditto data constructors, class operations, except that the hash of the parent class/tycon changes

• mi_globals :: !(Maybe GlobalRdrEnv)

  Binds all the things defined at the top level in the original source code for this module. which is NOT the same as mi_exports, nor mi_decls (which may contains declarations for things not actually defined by the user). Used for GHCi and for inspecting the contents of modules via the GHC API only.

  (We need the source file to figure out the top-level environment, if we didn't compile this module from source then this field contains Nothing).

  Strictly speaking this field should live in the HomeModInfo, but that leads to more plumbing.

• mi_insts :: [IfaceClsInst]

  Sorted class instance

• mi_fam_insts :: [IfaceFamInst]

  Sorted family instances

• mi_rules :: [IfaceRule]

  Sorted rules

• mi_hpc :: !AnyHpcUsage

  True if this program uses Hpc at any point in the program.

• mi_trust :: !IfaceTrustInfo

  Safe Haskell Trust information for this module.

• mi_trust_pkg :: !Bool

  Do we require the package this module resides in be trusted to trust this module? This is used for the situation where a module is Safe (so doesn't require the package be trusted itself) but imports some trustworthy modules from its own package (which does require its own package be trusted). See Note [Trust Own Package] in GHC.Rename.Names

• mi_complete_matches :: [IfaceCompleteMatch]
• mi_doc_hdr :: Maybe HsDocString

  Module header.

• mi_decl_docs :: DeclDocMap

  Docs on declarations.

• mi_arg_docs :: ArgDocMap

  Docs on arguments.

• mi_final_exts :: !(IfaceBackendExts phase)

  Either () or ModIfaceBackend for a fully instantiated interface.

• mi_ext_fields :: ExtensibleFields

  Additional optional fields, where the Map key represents the field name, resulting in a (size, serialized data) pair. Because the data is intended to be serialized through the internal Binary class (increasing compatibility with types using Name and FastString, such as HIE), this format is chosen over ByteStrings.

Instances

Binary ModIface

Defined in GHC.Unit.Module.ModIface

Methods

put_ :: BinHandle -> ModIface -> IO ()

put :: BinHandle -> ModIface -> IO (Bin ModIface)

get :: BinHandle -> IO ModIface

(NFData (IfaceBackendExts phase), NFData (IfaceDeclExts phase)) => NFData (ModIface_ phase)

Defined in GHC.Unit.Module.ModIface

Methods

rnf :: ModIface_ phase -> ()

data HscSource

Constructors

HsSrcFile

.hs file

HsBootFile

.hs-boot file

HsigFile

.hsig file

Instances

Show HscSource

Defined in GHC.Types.SourceFile

Methods

showsPrec :: Int -> HscSource -> ShowS

show :: HscSource -> String

showList :: [HscSource] -> ShowS

Binary HscSource

Defined in GHC.Types.SourceFile

Methods

put_ :: BinHandle -> HscSource -> IO ()

put :: BinHandle -> HscSource -> IO (Bin HscSource)

get :: BinHandle -> IO HscSource

Eq HscSource

Defined in GHC.Types.SourceFile

Methods

(==) :: HscSource -> HscSource -> Bool

(/=) :: HscSource -> HscSource -> Bool

Ord HscSource

Defined in GHC.Types.SourceFile

Methods

compare :: HscSource -> HscSource -> Ordering

(<) :: HscSource -> HscSource -> Bool

(<=) :: HscSource -> HscSource -> Bool

(>) :: HscSource -> HscSource -> Bool

(>=) :: HscSource -> HscSource -> Bool

max :: HscSource -> HscSource -> HscSource

min :: HscSource -> HscSource -> HscSource

data WhereFrom

Constructors

ImportByUser IsBootInterface

ImportBySystem

ImportByPlugin

Instances

Outputable WhereFrom

Defined in GHC.Tc.Types

Methods

ppr :: WhereFrom -> SDoc

loadInterface :: SDoc -> Module -> WhereFrom -> IfM lcl (MaybeErr SDoc ModIface)

data SourceModified

Indicates whether a given module's source has been modified since it was last compiled.

Constructors

SourceModified

the source has been modified

SourceUnmodified

the source has not been modified. Compilation may or may not be necessary, depending on whether any dependencies have changed since we last compiled.

SourceUnmodifiedAndStable

the source has not been modified, and furthermore all of its (transitive) dependencies are up to date; it definitely does not need to be recompiled. This is important for two reasons: (a) we can omit the version check in checkOldIface, and (b) if the module used TH splices we don't need to force recompilation.

Instances

Show SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> SourceModified -> ShowS

show :: SourceModified -> String

showList :: [SourceModified] -> ShowS

NFData SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: SourceModified -> ()

Eq SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

(==) :: SourceModified -> SourceModified -> Bool

(/=) :: SourceModified -> SourceModified -> Bool

loadModuleInterface :: SDoc -> Module -> TcM ModIface

Load interface directly for a fully qualified Module. (This is a fairly rare operation, but in particular it is used to load orphan modules in order to pull their instances into the global package table and to handle some operations in GHCi).

data RecompileRequired

Constructors

UpToDate

everything is up to date, recompilation is not required

MustCompile

The .hs file has been touched, or the .o/.hi file does not exist

RecompBecause String

The .o/.hi files are up to date, but something else has changed to force recompilation; the String says what (one-line summary)

Instances

Monoid RecompileRequired

Defined in GHC.Iface.Recomp

Methods

mempty :: RecompileRequired

mappend :: RecompileRequired -> RecompileRequired -> RecompileRequired

mconcat :: [RecompileRequired] -> RecompileRequired

Semigroup RecompileRequired

Defined in GHC.Iface.Recomp

Methods

(<>) :: RecompileRequired -> RecompileRequired -> RecompileRequired

sconcat :: NonEmpty RecompileRequired -> RecompileRequired

stimes :: Integral b => b -> RecompileRequired -> RecompileRequired

Eq RecompileRequired

Defined in GHC.Iface.Recomp

Methods

(==) :: RecompileRequired -> RecompileRequired -> Bool

(/=) :: RecompileRequired -> RecompileRequired -> Bool

mkPartialIface :: HscEnv -> ModDetails -> ModGuts -> PartialModIface

mkFullIface :: HscEnv -> PartialModIface -> Maybe CgInfos -> IO ModIface

Fully instantiate an interface. Adds fingerprints and potentially code generator produced information.

CgInfos is not available when not generating code (-fno-code), or when not generating interface pragmas (-fomit-interface-pragmas). See also Note [Conveying CAF-info and LFInfo between modules] in GHC.StgToCmm.Types.

checkOldIface :: HscEnv -> ModSummary -> SourceModified -> Maybe ModIface -> IO (RecompileRequired, Maybe ModIface)

Top level function to check if the version of an old interface file is equivalent to the current source file the user asked us to compile. If the same, we can avoid recompilation. We return a tuple where the first element is a bool saying if we should recompile the object file and the second is maybe the interface file, where Nothing means to rebuild the interface file and not use the existing one.

data IsBootInterface

Indicates whether a module name is referring to a boot interface (hs-boot file) or regular module (hs file). We need to treat boot modules specially when building compilation graphs, since they break cycles. Regular source files and signature files are treated equivalently.

Constructors

NotBoot

IsBoot

Instances

Data IsBootInterface

Defined in GHC.Unit.Types

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IsBootInterface -> c IsBootInterface

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IsBootInterface

toConstr :: IsBootInterface -> Constr

dataTypeOf :: IsBootInterface -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IsBootInterface)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IsBootInterface)

gmapT :: (forall b. Data b => b -> b) -> IsBootInterface -> IsBootInterface

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IsBootInterface -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IsBootInterface -> r

gmapQ :: (forall d. Data d => d -> u) -> IsBootInterface -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IsBootInterface -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

Show IsBootInterface

Defined in GHC.Unit.Types

Methods

showsPrec :: Int -> IsBootInterface -> ShowS

show :: IsBootInterface -> String

showList :: [IsBootInterface] -> ShowS

Binary IsBootInterface

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> IsBootInterface -> IO ()

put :: BinHandle -> IsBootInterface -> IO (Bin IsBootInterface)

get :: BinHandle -> IO IsBootInterface

Eq IsBootInterface

Defined in GHC.Unit.Types

Methods

(==) :: IsBootInterface -> IsBootInterface -> Bool

(/=) :: IsBootInterface -> IsBootInterface -> Bool

Ord IsBootInterface

Defined in GHC.Unit.Types

Methods

compare :: IsBootInterface -> IsBootInterface -> Ordering

(<) :: IsBootInterface -> IsBootInterface -> Bool

(<=) :: IsBootInterface -> IsBootInterface -> Bool

(>) :: IsBootInterface -> IsBootInterface -> Bool

(>=) :: IsBootInterface -> IsBootInterface -> Bool

max :: IsBootInterface -> IsBootInterface -> IsBootInterface

min :: IsBootInterface -> IsBootInterface -> IsBootInterface

Fixity

data LexicalFixity

Captures the fixity of declarations as they are parsed. This is not necessarily the same as the fixity declaration, as the normal fixity may be overridden using parens or backticks.

Constructors

Prefix

Infix

Instances

Data LexicalFixity

Defined in GHC.Types.Fixity

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LexicalFixity -> c LexicalFixity

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LexicalFixity

toConstr :: LexicalFixity -> Constr

dataTypeOf :: LexicalFixity -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LexicalFixity)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LexicalFixity)

gmapT :: (forall b. Data b => b -> b) -> LexicalFixity -> LexicalFixity

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFixity -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LexicalFixity -> r

gmapQ :: (forall d. Data d => d -> u) -> LexicalFixity -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> LexicalFixity -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LexicalFixity -> m LexicalFixity

Outputable LexicalFixity

Defined in GHC.Types.Fixity

Methods

ppr :: LexicalFixity -> SDoc

Eq LexicalFixity

Defined in GHC.Types.Fixity

Methods

(==) :: LexicalFixity -> LexicalFixity -> Bool

(/=) :: LexicalFixity -> LexicalFixity -> Bool

data Fixity

Constructors

Fixity SourceText Int FixityDirection

Instances

Data Fixity

Defined in GHC.Types.Fixity

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Fixity -> c Fixity

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Fixity

toConstr :: Fixity -> Constr

dataTypeOf :: Fixity -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Fixity)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Fixity)

gmapT :: (forall b. Data b => b -> b) -> Fixity -> Fixity

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Fixity -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Fixity -> r

gmapQ :: (forall d. Data d => d -> u) -> Fixity -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Fixity -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Fixity -> m Fixity

Binary Fixity

Defined in GHC.Types.Fixity

Methods

put_ :: BinHandle -> Fixity -> IO ()

put :: BinHandle -> Fixity -> IO (Bin Fixity)

get :: BinHandle -> IO Fixity

Outputable Fixity

Defined in GHC.Types.Fixity

Methods

ppr :: Fixity -> SDoc

Eq Fixity

Defined in GHC.Types.Fixity

Methods

(==) :: Fixity -> Fixity -> Bool

(/=) :: Fixity -> Fixity -> Bool

mi_fix :: ModIface -> OccName -> Fixity

Lookups up a (possibly cached) fixity from a ModIface_. If one cannot be found, defaultFixity is returned instead.

defaultFixity :: Fixity

lookupFixityRn :: Name -> RnM Fixity

ModSummary

data ModSummary

Data for a module node in a ModuleGraph. Module nodes of the module graph are one of:

• A regular Haskell source module
• A hi-boot source module

Constructors

ModSummary

Fields

• ms_mod :: Module

  Identity of the module

• ms_hsc_src :: HscSource

  The module source either plain Haskell, hs-boot, or hsig

• ms_location :: ModLocation

  Location of the various files belonging to the module

• ms_hs_date :: UTCTime

  Timestamp of source file

• ms_obj_date :: Maybe UTCTime

  Timestamp of object, if we have one

• ms_iface_date :: Maybe UTCTime

  Timestamp of hi file, if we *only* are typechecking (it is Nothing otherwise. See Note [Recompilation checking in -fno-code mode] and #9243

• ms_hie_date :: Maybe UTCTime

  Timestamp of hie file, if we have one

• ms_srcimps :: [(Maybe FastString, Located ModuleName)]

  Source imports of the module

• ms_textual_imps :: [(Maybe FastString, Located ModuleName)]

  Non-source imports of the module from the module *text*

• ms_parsed_mod :: Maybe HsParsedModule

  The parsed, nonrenamed source, if we have it. This is also used to support "inline module syntax" in Backpack files.

• ms_hspp_file :: FilePath

  Filename of preprocessed source file

• ms_hspp_opts :: DynFlags

  Cached flags from OPTIONS, INCLUDE and LANGUAGE pragmas in the modules source code

• ms_hspp_buf :: Maybe StringBuffer

  The actual preprocessed source, if we have it

Instances

Show ModSummary

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ModSummary -> ShowS

show :: ModSummary -> String

showList :: [ModSummary] -> ShowS

NFData ModSummary

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: ModSummary -> ()

Outputable ModSummary

Defined in GHC.Unit.Module.ModSummary

Methods

ppr :: ModSummary -> SDoc

HomeModInfo

data HomeModInfo

Information about modules in the package being compiled

Constructors

HomeModInfo

Fields

• hm_iface :: !ModIface

  The basic loaded interface file: every loaded module has one of these, even if it is imported from another package

• hm_details :: ModDetails

  Extra information that has been created from the ModIface_ for the module, typically during typechecking

• hm_linkable :: !(Maybe Linkable)

  The actual artifact we would like to link to access things in this module.

  hm_linkable might be Nothing:

  1. If this is an .hs-boot module
  2. Temporarily during compilation if we pruned away the old linkable because it was out of date.

  After a complete compilation (load), all hm_linkable fields in the HomePackageTable will be Just.

  When re-linking a module (HscNoRecomp), we construct the HomeModInfo by building a new ModDetails from the old ModIface_ (only).

Instances

Show HomeModInfo

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> HomeModInfo -> ShowS

show :: HomeModInfo -> String

showList :: [HomeModInfo] -> ShowS

NFData HomeModInfo

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: HomeModInfo -> ()

ModGuts

data ModGuts

A ModGuts is carried through the compiler, accumulating stuff as it goes There is only one ModGuts at any time, the one for the module being compiled right now. Once it is compiled, a ModIface and ModDetails are extracted and the ModGuts is discarded.

Constructors

ModGuts

Fields

• mg_module :: !Module

  Module being compiled

• mg_hsc_src :: HscSource

  Whether it's an hs-boot module

• mg_loc :: SrcSpan

  For error messages from inner passes

• mg_exports :: ![AvailInfo]

  What it exports

• mg_deps :: !Dependencies

  What it depends on, directly or otherwise

• mg_usages :: ![Usage]

  What was used? Used for interfaces.

• mg_used_th :: !Bool

  Did we run a TH splice?

• mg_rdr_env :: !GlobalRdrEnv

  Top-level lexical environment

• mg_fix_env :: !FixityEnv

  Fixities declared in this module. Used for creating interface files.

• mg_tcs :: ![TyCon]

  TyCons declared in this module (includes TyCons for classes)

• mg_insts :: ![ClsInst]

  Class instances declared in this module

• mg_fam_insts :: ![FamInst]

  Family instances declared in this module

• mg_patsyns :: ![PatSyn]

  Pattern synonyms declared in this module

• mg_rules :: ![CoreRule]

  Before the core pipeline starts, contains See Note [Overall plumbing for rules] in GHC.Core.Rules

• mg_binds :: !CoreProgram

  Bindings for this module

• mg_foreign :: !ForeignStubs

  Foreign exports declared in this module

• mg_foreign_files :: ![(ForeignSrcLang, FilePath)]

  Files to be compiled with the C compiler

• mg_warns :: !Warnings

  Warnings declared in the module

• mg_anns :: [Annotation]

  Annotations declared in this module

• mg_complete_matches :: [CompleteMatch]

  Complete Matches

• mg_hpc_info :: !HpcInfo

  Coverage tick boxes in the module

• mg_modBreaks :: !(Maybe ModBreaks)

  Breakpoints for the module

• mg_inst_env :: InstEnv

  Class instance environment for home-package modules (including this one); c.f. tcg_inst_env

• mg_fam_inst_env :: FamInstEnv

  Type-family instance environment for home-package modules (including this one); c.f. tcg_fam_inst_env

• mg_safe_haskell :: SafeHaskellMode

  Safe Haskell mode

• mg_trust_pkg :: Bool

  Do we need to trust our own package for Safe Haskell? See Note [Trust Own Package] in GHC.Rename.Names

• mg_doc_hdr :: !(Maybe HsDocString)

  Module header.

• mg_decl_docs :: !DeclDocMap

  Docs on declarations.

• mg_arg_docs :: !ArgDocMap

  Docs on arguments.

Instances

Show ModGuts

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ModGuts -> ShowS

show :: ModGuts -> String

showList :: [ModGuts] -> ShowS

NFData ModGuts

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: ModGuts -> ()

data CgGuts

A restricted form of ModGuts for code generation purposes

Constructors

CgGuts

Fields

• cg_module :: !Module

  Module being compiled

• cg_tycons :: [TyCon]

  Algebraic data types (including ones that started life as classes); generate constructors and info tables. Includes newtypes, just for the benefit of External Core

• cg_binds :: CoreProgram

  The tidied main bindings, including previously-implicit bindings for record and class selectors, and data constructor wrappers. But *not* data constructor workers; reason: we regard them as part of the code-gen of tycons

• cg_foreign :: !ForeignStubs

  Foreign export stubs

• cg_foreign_files :: ![(ForeignSrcLang, FilePath)]
• cg_dep_pkgs :: ![UnitId]

  Dependent packages, used to generate #includes for C code gen

• cg_hpc_info :: !HpcInfo

  Program coverage tick box information

• cg_modBreaks :: !(Maybe ModBreaks)

  Module breakpoints

• cg_spt_entries :: [SptEntry]

  Static pointer table entries for static forms defined in the module. See Note [Grand plan for static forms] in GHC.Iface.Tidy.StaticPtrTable

Instances

Show CgGuts

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> CgGuts -> ShowS

show :: CgGuts -> String

showList :: [CgGuts] -> ShowS

NFData CgGuts

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: CgGuts -> ()

ModDetails

data ModDetails

The ModDetails is essentially a cache for information in the ModIface for home modules only. Information relating to packages will be loaded into global environments in ExternalPackageState.

Constructors

ModDetails

Fields

• md_exports :: [AvailInfo]
• md_types :: !TypeEnv

  Local type environment for this particular module Includes Ids, TyCons, PatSyns

• md_insts :: ![ClsInst]

  DFunIds for the instances in this module

• md_fam_insts :: ![FamInst]
• md_rules :: ![CoreRule]

  Domain may include Ids from other modules

• md_anns :: ![Annotation]

  Annotations present in this module: currently they only annotate things also declared in this module

• md_complete_matches :: [CompleteMatch]

  Complete match pragmas for this module

Instances

Show ModDetails

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> ModDetails -> ShowS

show :: ModDetails -> String

showList :: [ModDetails] -> ShowS

NFData ModDetails

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: ModDetails -> ()

HsExpr,

Var

data Type

Constructors

TyVarTy Var

Vanilla type or kind variable (*never* a coercion variable)

AppTy Type Type

Type application to something other than a TyCon. Parameters:

1) Function: must not be a TyConApp or CastTy, must be another AppTy, or TyVarTy See Note [Respecting definitional equality] (EQ1) about the no CastTy requirement

2) Argument type

TyConApp TyCon [KindOrType]

Application of a TyCon, including newtypes and synonyms. Invariant: saturated applications of FunTyCon must use FunTy and saturated synonyms must use their own constructors. However, unsaturated FunTyCons do appear as TyConApps. Parameters:

1) Type constructor being applied to.

2) Type arguments. Might not have enough type arguments here to saturate the constructor. Even type synonyms are not necessarily saturated; for example unsaturated type synonyms can appear as the right hand side of a type synonym.

ForAllTy !TyCoVarBinder Type

A Π type. INVARIANT: If the binder is a coercion variable, it must be mentioned in the Type. See Note [Unused coercion variable in ForAllTy]

LitTy TyLit

Type literals are similar to type constructors.

CastTy Type KindCoercion

A kind cast. The coercion is always nominal. INVARIANT: The cast is never reflexive (EQ2) INVARIANT: The Type is not a CastTy (use TransCo instead) (EQ3) INVARIANT: The Type is not a ForAllTy over a tyvar (EQ4) See Note [Respecting definitional equality]

CoercionTy Coercion

Injection of a Coercion into a type This should only ever be used in the RHS of an AppTy, in the list of a TyConApp, when applying a promoted GADT data constructor

Instances

Data Type

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Type -> c Type

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Type

toConstr :: Type -> Constr

dataTypeOf :: Type -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Type)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Type)

gmapT :: (forall b. Data b => b -> b) -> Type -> Type

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r

gmapQ :: (forall d. Data d => d -> u) -> Type -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Type -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Type -> m Type

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type

NFData Type

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Type -> ()

Outputable Type

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Type -> SDoc

Eq (DeBruijn Type)

Defined in GHC.Core.Map.Type

Methods

(==) :: DeBruijn Type -> DeBruijn Type -> Bool

(/=) :: DeBruijn Type -> DeBruijn Type -> Bool

pattern FunTy :: Type -> Type -> Type

pattern ConPatIn :: Located (ConLikeP GhcPs) -> HsConPatDetails GhcPs -> Pat GhcPs

conPatDetails :: Pat p -> Maybe (HsConPatDetails p)

mapConPatDetail :: (HsConPatDetails p -> Maybe (HsConPatDetails p)) -> Pat p -> Maybe (Pat p)

mkVisFunTys :: [Scaled Type] -> Type -> Type

Make nested arrow types

mkInfForAllTys :: [TyVar] -> Type -> Type

Specs

data ImpDeclSpec

Import Declaration Specification

Describes a particular import declaration and is shared among all the Provenances for that decl

Constructors

ImpDeclSpec

Fields

• is_mod :: ModuleName

  Module imported, e.g. import Muggle Note the Muggle may well not be the defining module for this thing!

• is_as :: ModuleName

  Import alias, e.g. from as M (or Muggle if there is no as clause)

• is_qual :: Bool

  Was this import qualified?

• is_dloc :: SrcSpan

  The location of the entire import declaration

Instances

Data ImpDeclSpec

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImpDeclSpec -> c ImpDeclSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImpDeclSpec

toConstr :: ImpDeclSpec -> Constr

dataTypeOf :: ImpDeclSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImpDeclSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImpDeclSpec)

gmapT :: (forall b. Data b => b -> b) -> ImpDeclSpec -> ImpDeclSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImpDeclSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImpDeclSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> ImpDeclSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImpDeclSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

Eq ImpDeclSpec

Defined in GHC.Types.Name.Reader

Methods

(==) :: ImpDeclSpec -> ImpDeclSpec -> Bool

(/=) :: ImpDeclSpec -> ImpDeclSpec -> Bool

data ImportSpec

Import Specification

The ImportSpec of something says how it came to be imported It's quite elaborate so that we can give accurate unused-name warnings.

Constructors

ImpSpec

Fields

• is_decl :: ImpDeclSpec
• is_item :: ImpItemSpec

Instances

Data ImportSpec

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportSpec -> c ImportSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImportSpec

toConstr :: ImportSpec -> Constr

dataTypeOf :: ImportSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImportSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImportSpec)

gmapT :: (forall b. Data b => b -> b) -> ImportSpec -> ImportSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> ImportSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

Outputable ImportSpec

Defined in GHC.Types.Name.Reader

Methods

ppr :: ImportSpec -> SDoc

Eq ImportSpec

Defined in GHC.Types.Name.Reader

Methods

(==) :: ImportSpec -> ImportSpec -> Bool

(/=) :: ImportSpec -> ImportSpec -> Bool

SourceText

data SourceText

Constructors

SourceText String

NoSourceText

For when code is generated, e.g. TH, deriving. The pretty printer will then make its own representation of the item.

Instances

Data SourceText

Defined in GHC.Types.SourceText

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SourceText -> c SourceText

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SourceText

toConstr :: SourceText -> Constr

dataTypeOf :: SourceText -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SourceText)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SourceText)

gmapT :: (forall b. Data b => b -> b) -> SourceText -> SourceText

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SourceText -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SourceText -> r

gmapQ :: (forall d. Data d => d -> u) -> SourceText -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SourceText -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SourceText -> m SourceText

Show SourceText

Defined in GHC.Types.SourceText

Methods

showsPrec :: Int -> SourceText -> ShowS

show :: SourceText -> String

showList :: [SourceText] -> ShowS

Binary SourceText

Defined in GHC.Types.SourceText

Methods

put_ :: BinHandle -> SourceText -> IO ()

put :: BinHandle -> SourceText -> IO (Bin SourceText)

get :: BinHandle -> IO SourceText

Outputable SourceText

Defined in GHC.Types.SourceText

Methods

ppr :: SourceText -> SDoc

Eq SourceText

Defined in GHC.Types.SourceText

Methods

(==) :: SourceText -> SourceText -> Bool

(/=) :: SourceText -> SourceText -> Bool

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

Name

tyThingParent_maybe :: TyThing -> Maybe TyThing

tyThingParent_maybe x returns (Just p) when pprTyThingInContext should print a declaration for p (albeit with some "..." in it) when asked to show x It returns the *immediate* parent. So a datacon returns its tycon but the tycon could be the associated type of a class, so it in turn might have a parent.

Ways

data Way

A way

Don't change the constructor order as it us used by waysTag to create a unique tag (e.g. thr_debug_p) which is expected by other tools (e.g. Cabal).

Instances

Show Way

Defined in GHC.Platform.Ways

Methods

showsPrec :: Int -> Way -> ShowS

show :: Way -> String

showList :: [Way] -> ShowS

Eq Way

Defined in GHC.Platform.Ways

Methods

(==) :: Way -> Way -> Bool

(/=) :: Way -> Way -> Bool

Ord Way

Defined in GHC.Platform.Ways

Methods

compare :: Way -> Way -> Ordering

(<) :: Way -> Way -> Bool

(<=) :: Way -> Way -> Bool

(>) :: Way -> Way -> Bool

(>=) :: Way -> Way -> Bool

max :: Way -> Way -> Way

min :: Way -> Way -> Way

wayGeneralFlags :: Platform -> Way -> [GeneralFlag]

Turn these flags on when enabling this way

wayUnsetGeneralFlags :: Platform -> Way -> [GeneralFlag]

Turn these flags off when enabling this way

AvailInfo

data AvailInfo

Records what things are "available", i.e. in scope

Instances

Data AvailInfo

Defined in GHC.Types.Avail

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AvailInfo -> c AvailInfo

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AvailInfo

toConstr :: AvailInfo -> Constr

dataTypeOf :: AvailInfo -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AvailInfo)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AvailInfo)

gmapT :: (forall b. Data b => b -> b) -> AvailInfo -> AvailInfo

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AvailInfo -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AvailInfo -> r

gmapQ :: (forall d. Data d => d -> u) -> AvailInfo -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AvailInfo -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AvailInfo -> m AvailInfo

Binary AvailInfo

Defined in GHC.Types.Avail

Methods

put_ :: BinHandle -> AvailInfo -> IO ()

put :: BinHandle -> AvailInfo -> IO (Bin AvailInfo)

get :: BinHandle -> IO AvailInfo

Outputable AvailInfo

Defined in GHC.Types.Avail

Methods

ppr :: AvailInfo -> SDoc

Eq AvailInfo

Used when deciding if the interface has changed

Defined in GHC.Types.Avail

Methods

(==) :: AvailInfo -> AvailInfo -> Bool

(/=) :: AvailInfo -> AvailInfo -> Bool

pattern AvailName :: Name -> AvailInfo

pattern AvailFL :: FieldLabel -> AvailInfo

pattern AvailTC :: Name -> [Name] -> [FieldLabel] -> AvailInfo

availName :: AvailInfo -> Name

Just the main name made available, i.e. not the available pieces of type or class brought into scope by the AvailInfo

availNames :: AvailInfo -> [Name]

All names made available by the availability information (excluding overloaded selectors)

availNamesWithSelectors :: AvailInfo -> [Name]

All names made available by the availability information (including overloaded selectors)

availsToNameSet :: [AvailInfo] -> NameSet

TcGblEnv

data TcGblEnv

TcGblEnv describes the top-level of the module at the point at which the typechecker is finished work. It is this structure that is handed on to the desugarer For state that needs to be updated during the typechecking phase and returned at end, use a TcRef (= IORef).

Constructors

TcGblEnv

Fields

• tcg_mod :: Module

  Module being compiled

• tcg_semantic_mod :: Module

  If a signature, the backing module See also Note [Identity versus semantic module]

• tcg_src :: HscSource

  What kind of module (regular Haskell, hs-boot, hsig)

• tcg_rdr_env :: GlobalRdrEnv

  Top level envt; used during renaming

• tcg_default :: Maybe [Type]

  Types used for defaulting. Nothing => no default decl

• tcg_fix_env :: FixityEnv

  Just for things in this module

• tcg_field_env :: RecFieldEnv

  Just for things in this module See Note [The interactive package] in GHC.Runtime.Context

• tcg_type_env :: TypeEnv

  Global type env for the module we are compiling now. All TyCons and Classes (for this module) end up in here right away, along with their derived constructors, selectors.

  (Ids defined in this module start in the local envt, though they move to the global envt during zonking)

  NB: for what "things in this module" means, see Note [The interactive package] in GHC.Runtime.Context

• tcg_type_env_var :: TcRef TypeEnv
• tcg_inst_env :: !InstEnv

  Instance envt for all home-package modules; Includes the dfuns in tcg_insts NB. BangPattern is to fix a leak, see #15111

• tcg_fam_inst_env :: !FamInstEnv

  Ditto for family instances NB. BangPattern is to fix a leak, see #15111

• tcg_ann_env :: AnnEnv

  And for annotations

• tcg_exports :: [AvailInfo]

  What is exported

• tcg_imports :: ImportAvails

  Information about what was imported from where, including things bound in this module. Also store Safe Haskell info here about transitive trusted package requirements.

  There are not many uses of this field, so you can grep for all them.

  The ImportAvails records information about the following things:

  1. All of the modules you directly imported (tcRnImports)
  2. The orphans (only!) of all imported modules in a GHCi session (runTcInteractive)
  3. The module that instantiated a signature
  4. Each of the signatures that merged in

  It is used in the following ways: - imp_orphs is used to determine what orphan modules should be visible in the context (tcVisibleOrphanMods) - imp_finsts is used to determine what family instances should be visible (tcExtendLocalFamInstEnv) - To resolve the meaning of the export list of a module (tcRnExports) - imp_mods is used to compute usage info (mkIfaceTc, deSugar) - imp_trust_own_pkg is used for Safe Haskell in interfaces (mkIfaceTc, as well as in GHC.Driver.Main) - To create the Dependencies field in interface (mkDependencies)

• tcg_dus :: DefUses
• tcg_used_gres :: TcRef [GlobalRdrElt]
• tcg_keep :: TcRef NameSet
• tcg_th_used :: TcRef Bool

  True <=> Template Haskell syntax used.

  We need this so that we can generate a dependency on the Template Haskell package, because the desugarer is going to emit loads of references to TH symbols. The reference is implicit rather than explicit, so we have to zap a mutable variable.

• tcg_th_splice_used :: TcRef Bool

  True <=> A Template Haskell splice was used.

  Splices disable recompilation avoidance (see #481)

• tcg_dfun_n :: TcRef OccSet

  Allows us to choose unique DFun names.

• tcg_merged :: [(Module, Fingerprint)]

  The requirements we merged with; we always have to recompile if any of these changed.

• tcg_rn_exports :: Maybe [(LIE GhcRn, Avails)]
• tcg_rn_imports :: [LImportDecl GhcRn]
• tcg_rn_decls :: Maybe (HsGroup GhcRn)

  Renamed decls, maybe. Nothing <=> Don't retain renamed decls.

• tcg_dependent_files :: TcRef [FilePath]

  dependencies from addDependentFile

• tcg_th_topdecls :: TcRef [LHsDecl GhcPs]

  Top-level declarations from addTopDecls

• tcg_th_foreign_files :: TcRef [(ForeignSrcLang, FilePath)]

  Foreign files emitted from TH.

• tcg_th_topnames :: TcRef NameSet

  Exact names bound in top-level declarations in tcg_th_topdecls

• tcg_th_modfinalizers :: TcRef [(TcLclEnv, ThModFinalizers)]

  Template Haskell module finalizers.

  They can use particular local environments.

• tcg_th_coreplugins :: TcRef [String]

  Core plugins added by Template Haskell code.

• tcg_th_state :: TcRef (Map TypeRep Dynamic)
• tcg_th_remote_state :: TcRef (Maybe (ForeignRef (IORef QState)))

  Template Haskell state

• tcg_th_docs :: TcRef THDocs

  Docs added in Template Haskell via putDoc.

• tcg_ev_binds :: Bag EvBind
• tcg_tr_module :: Maybe Id
• tcg_binds :: LHsBinds GhcTc
• tcg_sigs :: NameSet
• tcg_imp_specs :: [LTcSpecPrag]
• tcg_warns :: Warnings
• tcg_anns :: [Annotation]
• tcg_tcs :: [TyCon]
• tcg_ksigs :: NameSet
• tcg_insts :: [ClsInst]
• tcg_fam_insts :: [FamInst]
• tcg_rules :: [LRuleDecl GhcTc]
• tcg_fords :: [LForeignDecl GhcTc]
• tcg_patsyns :: [PatSyn]
• tcg_doc_hdr :: Maybe LHsDocString

  Maybe Haddock header docs

• tcg_hpc :: !AnyHpcUsage

  True if any part of the prog uses hpc instrumentation. NB. BangPattern is to fix a leak, see #15111

• tcg_self_boot :: SelfBootInfo

  Whether this module has a corresponding hi-boot file

• tcg_main :: Maybe Name

  The Name of the main function, if this module is the main module.

• tcg_safeInfer :: TcRef (Bool, WarningMessages)

  Has the typechecker inferred this module as -XSafe (Safe Haskell) See Note [Safe Haskell Overlapping Instances Implementation], although this is used for more than just that failure case.

• tcg_tc_plugins :: [TcPluginSolver]

  A list of user-defined plugins for the constraint solver.

• tcg_hf_plugins :: [HoleFitPlugin]

  A list of user-defined plugins for hole fit suggestions.

• tcg_top_loc :: RealSrcSpan

  The RealSrcSpan this module came from

• tcg_static_wc :: TcRef WantedConstraints

  Wanted constraints of static forms. See Note [Constraints in static forms].

• tcg_complete_matches :: !CompleteMatches

  Tracking indices for cost centre annotations

• tcg_cc_st :: TcRef CostCentreState

Instances

ContainsModule TcGblEnv

Defined in GHC.Tc.Types

Methods

extractModule :: TcGblEnv -> Module

Parsing and LExer types

data HsModule

Haskell Module

All we actually declare here is the top-level structure for a module.

Constructors

HsModule

Fields

• hsmodAnn :: EpAnn AnnsModule
• hsmodLayout :: LayoutInfo

  Layout info for the module. For incomplete modules (e.g. the output of parseHeader), it is NoLayoutInfo.

• hsmodName :: Maybe (LocatedA ModuleName)

  Nothing: "module X where" is omitted (in which case the next field is Nothing too)

• hsmodExports :: Maybe (LocatedL [LIE GhcPs])

  Export list

  • Nothing: export list omitted, so export everything
  • Just []: export nothing
  • Just [...]: as you would expect...
  • AnnKeywordIds : AnnOpen ,AnnClose
• hsmodImports :: [LImportDecl GhcPs]

  We snaffle interesting stuff out of the imported interfaces early on, adding that info to TyDecls/etc; so this list is often empty, downstream.

• hsmodDecls :: [LHsDecl GhcPs]

  Type, class, value, and interface signature decls

• hsmodDeprecMessage :: Maybe (LocatedP WarningTxt)

  reason/explanation for warning/deprecation of this module

  • AnnKeywordIds : AnnOpen ,AnnClose
• hsmodHaddockModHeader :: Maybe LHsDocString

  Haddock module info and description, unparsed

  • AnnKeywordIds : AnnOpen ,AnnClose

Instances

Data HsModule

Defined in GHC.Hs

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsModule -> c HsModule

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsModule

toConstr :: HsModule -> Constr

dataTypeOf :: HsModule -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsModule)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsModule)

gmapT :: (forall b. Data b => b -> b) -> HsModule -> HsModule

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsModule -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsModule -> r

gmapQ :: (forall d. Data d => d -> u) -> HsModule -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsModule -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

NFData HsModule

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: HsModule -> ()

Outputable HsModule

Defined in GHC.Hs

Methods

ppr :: HsModule -> SDoc

type ParsedSource = Located HsModule

type RenamedSource = (HsGroup GhcRn, [LImportDecl GhcRn], Maybe [(LIE GhcRn, Avails)], Maybe LHsDocString)

Compilation Main

data HscEnv

HscEnv is like Session, except that some of the fields are immutable. An HscEnv is used to compile a single module from plain Haskell source code (after preprocessing) to either C, assembly or C--. It's also used to store the dynamic linker state to allow for multiple linkers in the same address space. Things like the module graph don't change during a single compilation.

Historical note: "hsc" used to be the name of the compiler binary, when there was a separate driver and compiler. To compile a single module, the driver would invoke hsc on the source code... so nowadays we think of hsc as the layer of the compiler that deals with compiling a single module.

runGhc

Arguments

:: Maybe FilePath

See argument to initGhcMonad.

-> Ghc a

The action to perform.

-> IO a

Run function for the Ghc monad.

It initialises the GHC session and warnings via initGhcMonad. Each call to this function will create a new session which should not be shared among several threads.

Any errors not handled inside the Ghc action are propagated as IO exceptions.

unGhc :: Ghc a -> Session -> IO a

data Session

The Session is a handle to the complete state of a compilation session. A compilation session consists of a set of modules constituting the current program or library, the context for interactive evaluation, and various caches.

Constructors

Session !(IORef HscEnv)

modifySession :: GhcMonad m => (HscEnv -> HscEnv) -> m ()

Set the current session to the result of applying the current session to the argument.

getSession :: GhcMonad m => m HscEnv

setSessionDynFlags :: GhcMonad m => DynFlags -> m ()

Updates both the interactive and program DynFlags in a Session. This also reads the package database (unless it has already been read), and prepares the compilers knowledge about packages. It can be called again to load new packages: just add new package flags to (packageFlags dflags).

getSessionDynFlags :: GhcMonad m => m DynFlags

Grabs the DynFlags from the Session

class (Functor m, ExceptionMonad m, HasDynFlags m, HasLogger m) => GhcMonad (m :: Type -> Type)

A monad that has all the features needed by GHC API calls.

In short, a GHC monad

• allows embedding of IO actions,
• can log warnings,
• allows handling of (extensible) exceptions, and
• maintains a current session.

If you do not use Ghc or GhcT, make sure to call initGhcMonad before any call to the GHC API functions can occur.

Minimal complete definition

getSession, setSession

Instances

GhcMonad Ghc

Defined in GHC.Driver.Monad

Methods

getSession :: Ghc HscEnv

setSession :: HscEnv -> Ghc ()

ExceptionMonad m => GhcMonad (GhcT m)

Defined in GHC.Driver.Monad

Methods

getSession :: GhcT m HscEnv

setSession :: HscEnv -> GhcT m ()

data Ghc a

A minimal implementation of a GhcMonad. If you need a custom monad, e.g., to maintain additional state consider wrapping this monad or using GhcT.

Instances

MonadFix Ghc

Defined in GHC.Driver.Monad

Methods

mfix :: (a -> Ghc a) -> Ghc a

MonadIO Ghc

Defined in GHC.Driver.Monad

Methods

liftIO :: IO a -> Ghc a

Applicative Ghc

Defined in GHC.Driver.Monad

Methods

pure :: a -> Ghc a

(<*>) :: Ghc (a -> b) -> Ghc a -> Ghc b

liftA2 :: (a -> b -> c) -> Ghc a -> Ghc b -> Ghc c

(*>) :: Ghc a -> Ghc b -> Ghc b

(<*) :: Ghc a -> Ghc b -> Ghc a

Functor Ghc

Defined in GHC.Driver.Monad

Methods

fmap :: (a -> b) -> Ghc a -> Ghc b

(<$) :: a -> Ghc b -> Ghc a

Monad Ghc

Defined in GHC.Driver.Monad

Methods

(>>=) :: Ghc a -> (a -> Ghc b) -> Ghc b

(>>) :: Ghc a -> Ghc b -> Ghc b

return :: a -> Ghc a

MonadCatch Ghc

Defined in GHC.Driver.Monad

Methods

catch :: Exception e => Ghc a -> (e -> Ghc a) -> Ghc a

MonadMask Ghc

Defined in GHC.Driver.Monad

Methods

mask :: ((forall a. Ghc a -> Ghc a) -> Ghc b) -> Ghc b

uninterruptibleMask :: ((forall a. Ghc a -> Ghc a) -> Ghc b) -> Ghc b

generalBracket :: Ghc a -> (a -> ExitCase b -> Ghc c) -> (a -> Ghc b) -> Ghc (b, c)

MonadThrow Ghc

Defined in GHC.Driver.Monad

Methods

throwM :: Exception e => e -> Ghc a

GhcMonad Ghc

Defined in GHC.Driver.Monad

Methods

getSession :: Ghc HscEnv

setSession :: HscEnv -> Ghc ()

HasDynFlags Ghc

Defined in GHC.Driver.Monad

Methods

getDynFlags :: Ghc DynFlags

HasLogger Ghc

Defined in GHC.Driver.Monad

Methods

getLogger :: Ghc Logger

runHsc :: HscEnv -> Hsc a -> IO a

compileFile :: HscEnv -> Phase -> (FilePath, Maybe Phase) -> IO FilePath

data Phase

Constructors

Unlit HscSource

Cpp HscSource

HsPp HscSource

Hsc HscSource

Ccxx

Cc

Cobjc

Cobjcxx

HCc

As Bool

LlvmOpt

LlvmLlc

LlvmMangle

CmmCpp

Cmm

MergeForeign

StopLn

Instances

Show Phase

Defined in GHC.Driver.Phases

Methods

showsPrec :: Int -> Phase -> ShowS

show :: Phase -> String

showList :: [Phase] -> ShowS

Outputable Phase

Defined in GHC.Driver.Phases

Methods

ppr :: Phase -> SDoc

Eq Phase

Defined in GHC.Driver.Phases

Methods

(==) :: Phase -> Phase -> Bool

(/=) :: Phase -> Phase -> Bool

hscDesugar :: HscEnv -> ModSummary -> TcGblEnv -> IO ModGuts

Convert a typechecked module to Core

hscGenHardCode

Arguments

:: HscEnv

-> CgGuts

-> ModLocation

-> FilePath

-> IO (FilePath, Maybe FilePath, [(ForeignSrcLang, FilePath)], CgInfos)

Just f = _stub.c is f

Compile to hard-code.

hscInteractive :: HscEnv -> CgGuts -> ModLocation -> IO (Maybe FilePath, CompiledByteCode, [SptEntry])

hscSimplify :: HscEnv -> [String] -> ModGuts -> IO ModGuts

Run Core2Core simplifier. The list of String is a list of (Core) plugin module names added via TH (cf addCorePlugin).

hscTypecheckRename :: HscEnv -> ModSummary -> HsParsedModule -> IO (TcGblEnv, RenamedStuff)

Rename and typecheck a module, additionally returning the renamed syntax

makeSimpleDetails :: HscEnv -> TcGblEnv -> IO ModDetails

Typecheck utils

tcSplitForAllTyVars :: Type -> ([TyVar], Type)

tcSplitForAllTyVarBinder_maybe :: Type -> Maybe (TyVarBinder, Type)

typecheckIface :: ModIface -> IfG ModDetails

mkIfaceTc :: HscEnv -> SafeHaskellMode -> ModDetails -> p -> TcGblEnv -> IO ModIface

mkBootModDetailsTc :: HscEnv -> TcGblEnv -> IO ModDetails

initTidyOpts :: HscEnv -> IO TidyOpts

hscUpdateHPT :: (HomePackageTable -> HomePackageTable) -> HscEnv -> HscEnv

driverNoStop :: Phase

tidyProgram :: HscEnv -> ModGuts -> IO (CgGuts, ModDetails)

data ImportedModsVal

Constructors

ImportedModsVal

Fields

• imv_name :: ModuleName

  The name the module is imported with

• imv_span :: SrcSpan

  the source span of the whole import

• imv_is_safe :: IsSafeImport

  whether this is a safe import

• imv_is_hiding :: Bool

  whether this is an "hiding" import

• imv_all_exports :: !GlobalRdrEnv

  all the things the module could provide.

  NB. BangPattern here: otherwise this leaks. (#15111)

• imv_qualified :: Bool

  whether this is a qualified import

importedByUser :: [ImportedBy] -> [ImportedModsVal]

type TypecheckedSource = LHsBinds GhcTc

Source Locations

class HasSrcSpan a

Minimal complete definition

getLoc

Instances

HasSrcSpan SrcSpan

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: SrcSpan -> SrcSpan

HasSrcSpan (SrcSpanAnn' ann)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: SrcSpanAnn' ann -> SrcSpan

HasSrcSpan (GenLocated (SrcSpanAnn' ann) a)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: GenLocated (SrcSpanAnn' ann) a -> SrcSpan

HasSrcSpan (GenLocated SrcSpan a)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: GenLocated SrcSpan a -> SrcSpan

type Located = GenLocated SrcSpan

unLoc :: GenLocated l e -> e

getLoc :: HasSrcSpan a => a -> SrcSpan

getLocA :: GenLocated (SrcSpanAnn' a) e -> SrcSpan

locA :: SrcSpanAnn' a -> SrcSpan

noLocA :: a -> LocatedAn an a

unLocA :: forall pass a. XRec (GhcPass pass) a -> a

type LocatedAn a = LocatedAn a

type LocatedA = LocatedA

data AnnListItem

Annotation for items appearing in a list. They can have one or more trailing punctuations items, such as commas or semicolons.

Constructors

AnnListItem

Fields

• lann_trailing :: [TrailingAnn]

Instances

Data AnnListItem

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnnListItem -> c AnnListItem

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnnListItem

toConstr :: AnnListItem -> Constr

dataTypeOf :: AnnListItem -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnnListItem)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnnListItem)

gmapT :: (forall b. Data b => b -> b) -> AnnListItem -> AnnListItem

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnnListItem -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnnListItem -> r

gmapQ :: (forall d. Data d => d -> u) -> AnnListItem -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnnListItem -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnnListItem -> m AnnListItem

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnListItem -> m AnnListItem

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnnListItem -> m AnnListItem

Monoid AnnListItem

Defined in GHC.Parser.Annotation

Methods

mempty :: AnnListItem

mappend :: AnnListItem -> AnnListItem -> AnnListItem

mconcat :: [AnnListItem] -> AnnListItem

Semigroup AnnListItem

Defined in GHC.Parser.Annotation

Methods

(<>) :: AnnListItem -> AnnListItem -> AnnListItem

sconcat :: NonEmpty AnnListItem -> AnnListItem

stimes :: Integral b => b -> AnnListItem -> AnnListItem

Outputable AnnListItem

Defined in GHC.Parser.Annotation

Methods

ppr :: AnnListItem -> SDoc

Eq AnnListItem

Defined in GHC.Parser.Annotation

Methods

(==) :: AnnListItem -> AnnListItem -> Bool

(/=) :: AnnListItem -> AnnListItem -> Bool

HasLoc (LocatedA a)

Defined in Compat.HieAst

Methods

loc :: LocatedA a -> SrcSpan

HiePass p => HasType (LocatedA (HsBind (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]

HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))

This instance tries to construct HieAST nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs.

HsApp, for example, doesn't have any type information available directly on the node. Our next recourse would be to desugar it into a CoreExpr then query the type of that. Yet both the desugaring call and the type query both involve recursive calls to the function and argument! This is particularly problematic when you realize that the HIE traversal will eventually visit those nodes too and ask for their types again.

Since the above is quite costly, we just skip cases where computing the expression's type is going to be expensive.

See #16233

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => HasType (LocatedA (Pat (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]

ToHie (LocatedA (ImportDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA HsWrapper)

Defined in Compat.HieAst

Methods

toHie :: LocatedA HsWrapper -> HieM [HieAST Type]

ToHie (LocatedA (FixitySig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (AnnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ClsInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ConDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DataFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DefaultDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DerivDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (FamilyDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ForeignDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (FunDep GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FunDep GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (InstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RoleAnnotDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RuleDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RuleDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (SpliceDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (StandaloneKindSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (TyClDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (TyFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (WarnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (WarnDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsSplice (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsSplice (GhcPass p)) -> HieM [HieAST Type]

(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

ToHie (LocatedA (ConDeclField GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (HsType GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]

ToHie (LocatedC [LocatedA (HsType GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]

ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]

ToHie (Context (Located a)) => ToHie (Context (LocatedA a))

Defined in Compat.HieAst

Methods

toHie :: Context (LocatedA a) -> HieM [HieAST Type]

ToHie (EvBindContext (LocatedA TcEvBinds))

Defined in Compat.HieAst

Methods

toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]

ToHie (IEContext (LIEWrappedName Name))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIEWrappedName Name) -> HieM [HieAST Type]

ToHie (IEContext (LocatedA (IE GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]

ToHie (IEContext (LocatedA ModuleName))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]

HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]

(ToHie (RFContext (Located label)), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsRecField' label arg)))

Defined in Compat.HieAst

Methods

toHie :: RContext (LocatedA (HsRecField' label arg)) -> HieM [HieAST Type]

HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]

HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]

ToHie (TScoped (LocatedA (HsSigType GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.PostProcess

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.Types

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

data NameAnn

exact print annotations for a RdrName. There are many kinds of adornment that can be attached to a given RdrName. This type captures them, as detailed on the individual constructors.

Constructors

NameAnn

Used for a name with an adornment, so `foo`, (bar)

Fields

• nann_adornment :: NameAdornment
• nann_open :: EpaLocation
• nann_name :: EpaLocation
• nann_close :: EpaLocation
• nann_trailing :: [TrailingAnn]

NameAnnCommas

Used for (,,,), or @()#

Fields

• nann_adornment :: NameAdornment
• nann_open :: EpaLocation
• nann_commas :: [EpaLocation]
• nann_close :: EpaLocation
• nann_trailing :: [TrailingAnn]

NameAnnOnly

Used for (), (##), []

Fields

• nann_adornment :: NameAdornment
• nann_open :: EpaLocation
• nann_close :: EpaLocation
• nann_trailing :: [TrailingAnn]

NameAnnRArrow

Used for ->, as an identifier

Fields

• nann_name :: EpaLocation
• nann_trailing :: [TrailingAnn]

NameAnnQuote

Used for an item with a leading '. The annotation for unquoted item is stored in nann_quoted.

Fields

• nann_quote :: EpaLocation
• nann_quoted :: SrcSpanAnnN
• nann_trailing :: [TrailingAnn]

NameAnnTrailing

Used when adding a TrailingAnn to an existing LocatedN which has no Api Annotation (via the EpAnnNotUsed constructor.

Fields

• nann_trailing :: [TrailingAnn]

Instances

Data NameAnn

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NameAnn -> c NameAnn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NameAnn

toConstr :: NameAnn -> Constr

dataTypeOf :: NameAnn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NameAnn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NameAnn)

gmapT :: (forall b. Data b => b -> b) -> NameAnn -> NameAnn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NameAnn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NameAnn -> r

gmapQ :: (forall d. Data d => d -> u) -> NameAnn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NameAnn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NameAnn -> m NameAnn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NameAnn -> m NameAnn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NameAnn -> m NameAnn

Monoid NameAnn

Defined in GHC.Parser.Annotation

Methods

mempty :: NameAnn

mappend :: NameAnn -> NameAnn -> NameAnn

mconcat :: [NameAnn] -> NameAnn

Semigroup NameAnn

Defined in GHC.Parser.Annotation

Methods

(<>) :: NameAnn -> NameAnn -> NameAnn

sconcat :: NonEmpty NameAnn -> NameAnn

stimes :: Integral b => b -> NameAnn -> NameAnn

Outputable NameAnn

Defined in GHC.Parser.Annotation

Methods

ppr :: NameAnn -> SDoc

Eq NameAnn

Defined in GHC.Parser.Annotation

Methods

(==) :: NameAnn -> NameAnn -> Bool

(/=) :: NameAnn -> NameAnn -> Bool

HasLoc (LocatedN a)

Defined in Compat.HieAst

Methods

loc :: LocatedN a -> SrcSpan

ToHie (LBooleanFormula (LocatedN Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]

ToHie (Context (Located a)) => ToHie (Context (LocatedN a))

Defined in Compat.HieAst

Methods

toHie :: Context (LocatedN a) -> HieM [HieAST Type]

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type RealLocated = GenLocated RealSrcSpan

data GenLocated l e

We attach SrcSpans to lots of things, so let's have a datatype for it.

Constructors

L l e

Instances

Bifunctor GenLocated

Defined in Development.IDE.GHC.Orphans

Methods

bimap :: (a -> b) -> (c -> d) -> GenLocated a c -> GenLocated b d

first :: (a -> b) -> GenLocated a c -> GenLocated b c

second :: (b -> c) -> GenLocated a b -> GenLocated a c

Foldable (GenLocated l)

Defined in GHC.Types.SrcLoc

Methods

fold :: Monoid m => GenLocated l m -> m

foldMap :: Monoid m => (a -> m) -> GenLocated l a -> m

foldMap' :: Monoid m => (a -> m) -> GenLocated l a -> m

foldr :: (a -> b -> b) -> b -> GenLocated l a -> b

foldr' :: (a -> b -> b) -> b -> GenLocated l a -> b

foldl :: (b -> a -> b) -> b -> GenLocated l a -> b

foldl' :: (b -> a -> b) -> b -> GenLocated l a -> b

foldr1 :: (a -> a -> a) -> GenLocated l a -> a

foldl1 :: (a -> a -> a) -> GenLocated l a -> a

toList :: GenLocated l a -> [a]

null :: GenLocated l a -> Bool

length :: GenLocated l a -> Int

elem :: Eq a => a -> GenLocated l a -> Bool

maximum :: Ord a => GenLocated l a -> a

minimum :: Ord a => GenLocated l a -> a

sum :: Num a => GenLocated l a -> a

product :: Num a => GenLocated l a -> a

Traversable (GenLocated l)

Defined in GHC.Types.SrcLoc

Methods

traverse :: Applicative f => (a -> f b) -> GenLocated l a -> f (GenLocated l b)

sequenceA :: Applicative f => GenLocated l (f a) -> f (GenLocated l a)

mapM :: Monad m => (a -> m b) -> GenLocated l a -> m (GenLocated l b)

sequence :: Monad m => GenLocated l (m a) -> m (GenLocated l a)

Functor (GenLocated l)

Defined in GHC.Types.SrcLoc

Methods

fmap :: (a -> b) -> GenLocated l a -> GenLocated l b

(<$) :: a -> GenLocated l b -> GenLocated l a

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

Binary a => Binary (LocatedL a)

Defined in GHC.Parser.Annotation

Methods

put_ :: BinHandle -> LocatedL a -> IO ()

put :: BinHandle -> LocatedL a -> IO (Bin (LocatedL a))

get :: BinHandle -> IO (LocatedL a)

Binary a => Binary (Located a)

Defined in GHC.Utils.Binary

Methods

put_ :: BinHandle -> Located a -> IO ()

put :: BinHandle -> Located a -> IO (Bin (Located a))

get :: BinHandle -> IO (Located a)

Outputable e => Outputable (Located e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: Located e -> SDoc

HasLoc (LocatedA a)

Defined in Compat.HieAst

Methods

loc :: LocatedA a -> SrcSpan

HasLoc (LocatedN a)

Defined in Compat.HieAst

Methods

loc :: LocatedN a -> SrcSpan

HasLoc (Located a)

Defined in Compat.HieAst

Methods

loc :: Located a -> SrcSpan

HiePass p => HasType (LocatedA (HsBind (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]

HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))

This instance tries to construct HieAST nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs.

HsApp, for example, doesn't have any type information available directly on the node. Our next recourse would be to desugar it into a CoreExpr then query the type of that. Yet both the desugaring call and the type query both involve recursive calls to the function and argument! This is particularly problematic when you realize that the HIE traversal will eventually visit those nodes too and ask for their types again.

Since the above is quite costly, we just skip cases where computing the expression's type is going to be expensive.

See #16233

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => HasType (LocatedA (Pat (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]

ToHie (LBooleanFormula (LocatedN Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]

ToHie (LocatedA (ImportDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA HsWrapper)

Defined in Compat.HieAst

Methods

toHie :: LocatedA HsWrapper -> HieM [HieAST Type]

ToHie (LocatedA (FixitySig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (AnnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ClsInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ConDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DataFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DefaultDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DerivDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (FamilyDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ForeignDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (FunDep GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FunDep GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (InstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RoleAnnotDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RuleDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RuleDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (SpliceDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (StandaloneKindSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (TyClDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (TyFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (WarnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (WarnDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsSplice (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsSplice (GhcPass p)) -> HieM [HieAST Type]

(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

ToHie (LocatedA (ConDeclField GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (HsType GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]

ToHie (LocatedC (DerivClauseTys GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]

ToHie (LocatedC [LocatedA (HsType GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]

ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]

ToHie (LocatedP OverlapMode)

Defined in Compat.HieAst

Methods

toHie :: LocatedP OverlapMode -> HieM [HieAST Type]

HiePass p => ToHie (Located (PatSynBind (GhcPass p) (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: Located (PatSynBind (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]

ToHie (Located (DerivStrategy GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (DerivStrategy GhcRn) -> HieM [HieAST Type]

ToHie (Located (HsDerivingClause GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (HsDerivingClause GhcRn) -> HieM [HieAST Type]

ToHie (Located (InjectivityAnn GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (InjectivityAnn GhcRn) -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

HiePass p => ToHie (Located (HsCmdTop (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: Located (HsCmdTop (GhcPass p)) -> HieM [HieAST Type]

ToHie (Located HsIPName)

Defined in Compat.HieAst

Methods

toHie :: Located HsIPName -> HieM [HieAST Type]

ToHie (Located [Located (HsDerivingClause GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: Located [Located (HsDerivingClause GhcRn)] -> HieM [HieAST Type]

HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]

ToHie (Context (Located a)) => ToHie (Context (LocatedA a))

Defined in Compat.HieAst

Methods

toHie :: Context (LocatedA a) -> HieM [HieAST Type]

ToHie (Context (Located a)) => ToHie (Context (LocatedN a))

Defined in Compat.HieAst

Methods

toHie :: Context (LocatedN a) -> HieM [HieAST Type]

ToHie (Context (Located Name))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Name) -> HieM [HieAST Type]

ToHie (Context (Located Var))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Var) -> HieM [HieAST Type]

ToHie (Context (Located NoExtField))

Defined in Compat.HieAst

Methods

toHie :: Context (Located NoExtField) -> HieM [HieAST Type]

ToHie (EvBindContext (LocatedA TcEvBinds))

Defined in Compat.HieAst

Methods

toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]

ToHie (IEContext (LIEWrappedName Name))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIEWrappedName Name) -> HieM [HieAST Type]

ToHie (IEContext (LocatedA (IE GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]

ToHie (IEContext (LocatedA ModuleName))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]

ToHie (IEContext (Located FieldLabel))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located FieldLabel) -> HieM [HieAST Type]

HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]

(ToHie (RFContext (Located label)), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsRecField' label arg)))

Defined in Compat.HieAst

Methods

toHie :: RContext (LocatedA (HsRecField' label arg)) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcRn)) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcTc)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcTc)) -> HieM [HieAST Type]

ToHie (RFContext (Located (FieldOcc GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (FieldOcc GhcRn)) -> HieM [HieAST Type]

ToHie (RFContext (Located (FieldOcc GhcTc)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (FieldOcc GhcTc)) -> HieM [HieAST Type]

HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]

ToHie (RScoped (Located (FamilyResultSig GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (Located (FamilyResultSig GhcRn)) -> HieM [HieAST Type]

ToHie (RScoped (Located (RuleBndr GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (Located (RuleBndr GhcRn)) -> HieM [HieAST Type]

HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]

ToHie (TScoped (LocatedA (HsSigType GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]

(Data l, Data e) => Data (GenLocated l e)

Defined in GHC.Types.SrcLoc

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenLocated l e -> c (GenLocated l e)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GenLocated l e)

toConstr :: GenLocated l e -> Constr

dataTypeOf :: GenLocated l e -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GenLocated l e))

dataCast2 :: Typeable t => (forall d e0. (Data d, Data e0) => c (t d e0)) -> Maybe (c (GenLocated l e))

gmapT :: (forall b. Data b => b -> b) -> GenLocated l e -> GenLocated l e

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenLocated l e -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenLocated l e -> r

gmapQ :: (forall d. Data d => d -> u) -> GenLocated l e -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GenLocated l e -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenLocated l e -> m (GenLocated l e)

Outputable a => Show (GenLocated SrcSpan a)

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> GenLocated SrcSpan a -> ShowS

show :: GenLocated SrcSpan a -> String

showList :: [GenLocated SrcSpan a] -> ShowS

(NFData l, NFData e) => NFData (GenLocated l e)

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: GenLocated l e -> ()

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

Outputable (GenLocated Anchor EpaComment)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated Anchor EpaComment -> SDoc

(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc

Outputable e => Outputable (GenLocated RealSrcSpan e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: GenLocated RealSrcSpan e -> SDoc

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

(Eq l, Eq e) => Eq (GenLocated l e)

Defined in GHC.Types.SrcLoc

Methods

(==) :: GenLocated l e -> GenLocated l e -> Bool

(/=) :: GenLocated l e -> GenLocated l e -> Bool

(Ord l, Ord e) => Ord (GenLocated l e)

Defined in GHC.Types.SrcLoc

Methods

compare :: GenLocated l e -> GenLocated l e -> Ordering

(<) :: GenLocated l e -> GenLocated l e -> Bool

(<=) :: GenLocated l e -> GenLocated l e -> Bool

(>) :: GenLocated l e -> GenLocated l e -> Bool

(>=) :: GenLocated l e -> GenLocated l e -> Bool

max :: GenLocated l e -> GenLocated l e -> GenLocated l e

min :: GenLocated l e -> GenLocated l e -> GenLocated l e

HasSrcSpan (GenLocated (SrcSpanAnn' ann) a)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: GenLocated (SrcSpanAnn' ann) a -> SrcSpan

HasSrcSpan (GenLocated SrcSpan a)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: GenLocated SrcSpan a -> SrcSpan

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.PostProcess

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.Types

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

data SrcSpan

Source Span

A SrcSpan identifies either a specific portion of a text file or a human-readable description of a location.

Constructors

UnhelpfulSpan !UnhelpfulSpanReason

Instances

Data SrcSpan

Defined in GHC.Types.SrcLoc

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcSpan -> c SrcSpan

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcSpan

toConstr :: SrcSpan -> Constr

dataTypeOf :: SrcSpan -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcSpan)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcSpan)

gmapT :: (forall b. Data b => b -> b) -> SrcSpan -> SrcSpan

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpan -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpan -> r

gmapQ :: (forall d. Data d => d -> u) -> SrcSpan -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcSpan -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpan -> m SrcSpan

Show SrcSpan

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> SrcSpan -> ShowS

show :: SrcSpan -> String

showList :: [SrcSpan] -> ShowS

NFData SrcSpan

Defined in GHC.Types.SrcLoc

Methods

rnf :: SrcSpan -> ()

Binary SrcSpan

Defined in GHC.Utils.Binary

Methods

put_ :: BinHandle -> SrcSpan -> IO ()

put :: BinHandle -> SrcSpan -> IO (Bin SrcSpan)

get :: BinHandle -> IO SrcSpan

ToJson SrcSpan

Defined in GHC.Types.SrcLoc

Methods

json :: SrcSpan -> JsonDoc

Outputable SrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcSpan -> SDoc

Eq SrcSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: SrcSpan -> SrcSpan -> Bool

(/=) :: SrcSpan -> SrcSpan -> Bool

Ord SrcSpan

Defined in Development.IDE.GHC.Orphans

Methods

compare :: SrcSpan -> SrcSpan -> Ordering

(<) :: SrcSpan -> SrcSpan -> Bool

(<=) :: SrcSpan -> SrcSpan -> Bool

(>) :: SrcSpan -> SrcSpan -> Bool

(>=) :: SrcSpan -> SrcSpan -> Bool

max :: SrcSpan -> SrcSpan -> SrcSpan

min :: SrcSpan -> SrcSpan -> SrcSpan

HasSrcSpan SrcSpan

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: SrcSpan -> SrcSpan

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

Binary a => Binary (Located a)

Defined in GHC.Utils.Binary

Methods

put_ :: BinHandle -> Located a -> IO ()

put :: BinHandle -> Located a -> IO (Bin (Located a))

get :: BinHandle -> IO (Located a)

Outputable e => Outputable (Located e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: Located e -> SDoc

HasLoc (Located a)

Defined in Compat.HieAst

Methods

loc :: Located a -> SrcSpan

HiePass p => ToHie (Located (PatSynBind (GhcPass p) (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: Located (PatSynBind (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]

ToHie (Located (DerivStrategy GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (DerivStrategy GhcRn) -> HieM [HieAST Type]

ToHie (Located (HsDerivingClause GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (HsDerivingClause GhcRn) -> HieM [HieAST Type]

ToHie (Located (InjectivityAnn GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (InjectivityAnn GhcRn) -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

HiePass p => ToHie (Located (HsCmdTop (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: Located (HsCmdTop (GhcPass p)) -> HieM [HieAST Type]

ToHie (Located HsIPName)

Defined in Compat.HieAst

Methods

toHie :: Located HsIPName -> HieM [HieAST Type]

ToHie (Located [Located (HsDerivingClause GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: Located [Located (HsDerivingClause GhcRn)] -> HieM [HieAST Type]

ToHie (Context (Located Name))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Name) -> HieM [HieAST Type]

ToHie (Context (Located Var))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Var) -> HieM [HieAST Type]

ToHie (Context (Located NoExtField))

Defined in Compat.HieAst

Methods

toHie :: Context (Located NoExtField) -> HieM [HieAST Type]

ToHie (IEContext (Located FieldLabel))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located FieldLabel) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcRn)) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcTc)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcTc)) -> HieM [HieAST Type]

ToHie (RFContext (Located (FieldOcc GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (FieldOcc GhcRn)) -> HieM [HieAST Type]

ToHie (RFContext (Located (FieldOcc GhcTc)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (FieldOcc GhcTc)) -> HieM [HieAST Type]

ToHie (RScoped (Located (FamilyResultSig GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (Located (FamilyResultSig GhcRn)) -> HieM [HieAST Type]

ToHie (RScoped (Located (RuleBndr GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (Located (RuleBndr GhcRn)) -> HieM [HieAST Type]

Outputable a => Show (GenLocated SrcSpan a)

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> GenLocated SrcSpan a -> ShowS

show :: GenLocated SrcSpan a -> String

showList :: [GenLocated SrcSpan a] -> ShowS

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

HasSrcSpan (GenLocated SrcSpan a)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: GenLocated SrcSpan a -> SrcSpan

data RealSrcSpan

A SrcSpan delimits a portion of a text file. It could be represented by a pair of (line,column) coordinates, but in fact we optimise slightly by using more compact representations for single-line and zero-length spans, both of which are quite common.

The end position is defined to be the column after the end of the span. That is, a span of (1,1)-(1,2) is one character long, and a span of (1,1)-(1,1) is zero characters long.

Real Source Span

Instances

FromJSON RealSrcSpan

Defined in Development.IDE.GHC.Orphans

Methods

parseJSON :: Value -> Parser RealSrcSpan

parseJSONList :: Value -> Parser [RealSrcSpan]

ToJSON RealSrcSpan

Defined in Development.IDE.GHC.Orphans

Methods

toJSON :: RealSrcSpan -> Value

toEncoding :: RealSrcSpan -> Encoding

toJSONList :: [RealSrcSpan] -> Value

toEncodingList :: [RealSrcSpan] -> Encoding

Data RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RealSrcSpan -> c RealSrcSpan

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RealSrcSpan

toConstr :: RealSrcSpan -> Constr

dataTypeOf :: RealSrcSpan -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RealSrcSpan)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RealSrcSpan)

gmapT :: (forall b. Data b => b -> b) -> RealSrcSpan -> RealSrcSpan

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RealSrcSpan -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RealSrcSpan -> r

gmapQ :: (forall d. Data d => d -> u) -> RealSrcSpan -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> RealSrcSpan -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RealSrcSpan -> m RealSrcSpan

Show RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> RealSrcSpan -> ShowS

show :: RealSrcSpan -> String

showList :: [RealSrcSpan] -> ShowS

NFData RealSrcSpan

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: RealSrcSpan -> ()

Binary RealSrcSpan

Defined in GHC.Utils.Binary

Methods

put_ :: BinHandle -> RealSrcSpan -> IO ()

put :: BinHandle -> RealSrcSpan -> IO (Bin RealSrcSpan)

get :: BinHandle -> IO RealSrcSpan

ToJson RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

json :: RealSrcSpan -> JsonDoc

Outputable RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcSpan -> SDoc

Eq RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: RealSrcSpan -> RealSrcSpan -> Bool

(/=) :: RealSrcSpan -> RealSrcSpan -> Bool

Ord RealSrcSpan

Defined in GHC.Types.SrcLoc

Methods

compare :: RealSrcSpan -> RealSrcSpan -> Ordering

(<) :: RealSrcSpan -> RealSrcSpan -> Bool

(<=) :: RealSrcSpan -> RealSrcSpan -> Bool

(>) :: RealSrcSpan -> RealSrcSpan -> Bool

(>=) :: RealSrcSpan -> RealSrcSpan -> Bool

max :: RealSrcSpan -> RealSrcSpan -> RealSrcSpan

min :: RealSrcSpan -> RealSrcSpan -> RealSrcSpan

MapAge RealSrcSpan

Defined in Development.IDE.Core.UseStale

Methods

mapAgeFrom :: forall (from :: Age) (to :: Age). PositionMap from to -> Tracked to RealSrcSpan -> Maybe (Tracked from RealSrcSpan)

mapAgeTo :: forall (from :: Age) (to :: Age). PositionMap from to -> Tracked from RealSrcSpan -> Maybe (Tracked to RealSrcSpan)

Outputable e => Outputable (GenLocated RealSrcSpan e)

Defined in GHC.Types.SrcLoc

Methods

ppr :: GenLocated RealSrcSpan e -> SDoc

pattern RealSrcSpan :: RealSrcSpan -> Maybe BufSpan -> SrcSpan

data RealSrcLoc

Real Source Location

Represents a single point within a file

Instances

Show RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> RealSrcLoc -> ShowS

show :: RealSrcLoc -> String

showList :: [RealSrcLoc] -> ShowS

Outputable RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: RealSrcLoc -> SDoc

Eq RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

(==) :: RealSrcLoc -> RealSrcLoc -> Bool

(/=) :: RealSrcLoc -> RealSrcLoc -> Bool

Ord RealSrcLoc

Defined in GHC.Types.SrcLoc

Methods

compare :: RealSrcLoc -> RealSrcLoc -> Ordering

(<) :: RealSrcLoc -> RealSrcLoc -> Bool

(<=) :: RealSrcLoc -> RealSrcLoc -> Bool

(>) :: RealSrcLoc -> RealSrcLoc -> Bool

(>=) :: RealSrcLoc -> RealSrcLoc -> Bool

max :: RealSrcLoc -> RealSrcLoc -> RealSrcLoc

min :: RealSrcLoc -> RealSrcLoc -> RealSrcLoc

pattern RealSrcLoc :: RealSrcLoc -> Maybe BufPos -> SrcLoc

data SrcLoc

Source Location

Constructors

UnhelpfulLoc FastString

Instances

Show SrcLoc

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> SrcLoc -> ShowS

show :: SrcLoc -> String

showList :: [SrcLoc] -> ShowS

Outputable SrcLoc

Defined in GHC.Types.SrcLoc

Methods

ppr :: SrcLoc -> SDoc

Eq SrcLoc

Defined in GHC.Types.SrcLoc

Methods

(==) :: SrcLoc -> SrcLoc -> Bool

(/=) :: SrcLoc -> SrcLoc -> Bool

data BufSpan

StringBuffer Source Span

Instances

Semigroup BufSpan

Defined in GHC.Types.SrcLoc

Methods

(<>) :: BufSpan -> BufSpan -> BufSpan

sconcat :: NonEmpty BufSpan -> BufSpan

stimes :: Integral b => b -> BufSpan -> BufSpan

Show BufSpan

Defined in GHC.Types.SrcLoc

Methods

showsPrec :: Int -> BufSpan -> ShowS

show :: BufSpan -> String

showList :: [BufSpan] -> ShowS

Binary BufSpan

Defined in GHC.Utils.Binary

Methods

put_ :: BinHandle -> BufSpan -> IO ()

put :: BinHandle -> BufSpan -> IO (Bin BufSpan)

get :: BinHandle -> IO BufSpan

Eq BufSpan

Defined in GHC.Types.SrcLoc

Methods

(==) :: BufSpan -> BufSpan -> Bool

(/=) :: BufSpan -> BufSpan -> Bool

Ord BufSpan

Defined in GHC.Types.SrcLoc

Methods

compare :: BufSpan -> BufSpan -> Ordering

(<) :: BufSpan -> BufSpan -> Bool

(<=) :: BufSpan -> BufSpan -> Bool

(>) :: BufSpan -> BufSpan -> Bool

(>=) :: BufSpan -> BufSpan -> Bool

max :: BufSpan -> BufSpan -> BufSpan

min :: BufSpan -> BufSpan -> BufSpan

data SrcSpanAnn' a

The 'SrcSpanAnn'' type wraps a normal SrcSpan, together with an extra annotation type. This is mapped to a specific GenLocated usage in the AST through the XRec and Anno type families.

Instances

Functor SrcSpanAnn'

Defined in Development.IDE.GHC.Orphans

Methods

fmap :: (a -> b) -> SrcSpanAnn' a -> SrcSpanAnn' b

(<$) :: a -> SrcSpanAnn' b -> SrcSpanAnn' a

Data a => Data (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcSpanAnn' a -> c (SrcSpanAnn' a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SrcSpanAnn' a)

toConstr :: SrcSpanAnn' a -> Constr

dataTypeOf :: SrcSpanAnn' a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SrcSpanAnn' a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SrcSpanAnn' a))

gmapT :: (forall b. Data b => b -> b) -> SrcSpanAnn' a -> SrcSpanAnn' a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpanAnn' a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpanAnn' a -> r

gmapQ :: (forall d. Data d => d -> u) -> SrcSpanAnn' a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcSpanAnn' a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a)

Semigroup an => Semigroup (SrcSpanAnn' an)

Defined in GHC.Parser.Annotation

Methods

(<>) :: SrcSpanAnn' an -> SrcSpanAnn' an -> SrcSpanAnn' an

sconcat :: NonEmpty (SrcSpanAnn' an) -> SrcSpanAnn' an

stimes :: Integral b => b -> SrcSpanAnn' an -> SrcSpanAnn' an

NFData (SrcSpanAnn' a)

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: SrcSpanAnn' a -> ()

Binary a => Binary (LocatedL a)

Defined in GHC.Parser.Annotation

Methods

put_ :: BinHandle -> LocatedL a -> IO ()

put :: BinHandle -> LocatedL a -> IO (Bin (LocatedL a))

get :: BinHandle -> IO (LocatedL a)

Outputable a => Outputable (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

ppr :: SrcSpanAnn' a -> SDoc

Eq a => Eq (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

(==) :: SrcSpanAnn' a -> SrcSpanAnn' a -> Bool

(/=) :: SrcSpanAnn' a -> SrcSpanAnn' a -> Bool

HasSrcSpan (SrcSpanAnn' ann)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: SrcSpanAnn' ann -> SrcSpan

HasLoc (LocatedA a)

Defined in Compat.HieAst

Methods

loc :: LocatedA a -> SrcSpan

HasLoc (LocatedN a)

Defined in Compat.HieAst

Methods

loc :: LocatedN a -> SrcSpan

HiePass p => HasType (LocatedA (HsBind (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]

HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))

This instance tries to construct HieAST nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs.

HsApp, for example, doesn't have any type information available directly on the node. Our next recourse would be to desugar it into a CoreExpr then query the type of that. Yet both the desugaring call and the type query both involve recursive calls to the function and argument! This is particularly problematic when you realize that the HIE traversal will eventually visit those nodes too and ask for their types again.

Since the above is quite costly, we just skip cases where computing the expression's type is going to be expensive.

See #16233

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => HasType (LocatedA (Pat (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]

ToHie (LBooleanFormula (LocatedN Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]

ToHie (LocatedA (ImportDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA HsWrapper)

Defined in Compat.HieAst

Methods

toHie :: LocatedA HsWrapper -> HieM [HieAST Type]

ToHie (LocatedA (FixitySig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (AnnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ClsInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ConDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DataFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DefaultDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DerivDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (FamilyDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ForeignDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (FunDep GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FunDep GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (InstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RoleAnnotDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RuleDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RuleDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (SpliceDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (StandaloneKindSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (TyClDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (TyFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (WarnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (WarnDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsSplice (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsSplice (GhcPass p)) -> HieM [HieAST Type]

(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

ToHie (LocatedA (ConDeclField GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (HsType GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]

ToHie (LocatedC (DerivClauseTys GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]

ToHie (LocatedC [LocatedA (HsType GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]

ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]

ToHie (LocatedP OverlapMode)

Defined in Compat.HieAst

Methods

toHie :: LocatedP OverlapMode -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]

ToHie (Context (Located a)) => ToHie (Context (LocatedA a))

Defined in Compat.HieAst

Methods

toHie :: Context (LocatedA a) -> HieM [HieAST Type]

ToHie (Context (Located a)) => ToHie (Context (LocatedN a))

Defined in Compat.HieAst

Methods

toHie :: Context (LocatedN a) -> HieM [HieAST Type]

ToHie (EvBindContext (LocatedA TcEvBinds))

Defined in Compat.HieAst

Methods

toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]

ToHie (IEContext (LIEWrappedName Name))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIEWrappedName Name) -> HieM [HieAST Type]

ToHie (IEContext (LocatedA (IE GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]

ToHie (IEContext (LocatedA ModuleName))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]

HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]

(ToHie (RFContext (Located label)), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsRecField' label arg)))

Defined in Compat.HieAst

Methods

toHie :: RContext (LocatedA (HsRecField' label arg)) -> HieM [HieAST Type]

HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]

HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]

ToHie (TScoped (LocatedA (HsSigType GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc

HasSrcSpan (GenLocated (SrcSpanAnn' ann) a)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: GenLocated (SrcSpanAnn' ann) a -> SrcSpan

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.PostProcess

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.Types

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type SrcAnn ann = SrcSpanAnn' (EpAnn ann)

We mostly use 'SrcSpanAnn'' with an 'EpAnn''

leftmost_smallest :: SrcSpan -> SrcSpan -> Ordering

Strategies for ordering SrcSpans

containsSpan :: RealSrcSpan -> RealSrcSpan -> Bool

Tests whether the first span "contains" the other span, meaning that it covers at least as much source code. True where spans are equal.

mkGeneralSrcSpan :: FastString -> SrcSpan

Create a "bad" SrcSpan that has not location information

mkRealSrcSpan :: RealSrcLoc -> RealSrcLoc -> RealSrcSpan

Create a SrcSpan between two points in a file

mkRealSrcLoc :: FastString -> Int -> Int -> RealSrcLoc

getRealSrcSpan :: RealLocated a -> RealSrcSpan

realSrcLocSpan :: RealSrcLoc -> RealSrcSpan

realSrcSpanStart :: RealSrcSpan -> RealSrcLoc

realSrcSpanEnd :: RealSrcSpan -> RealSrcLoc

isSubspanOfA :: LocatedAn la a -> LocatedAn lb b -> Bool

isSubspanOf

Arguments

:: SrcSpan

The span that may be enclosed by the other

-> SrcSpan

The span it may be enclosed by

-> Bool

Determines whether a span is enclosed by another one

wiredInSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

mkSrcSpan :: SrcLoc -> SrcLoc -> SrcSpan

Create a SrcSpan between two points in a file

srcSpanStart :: SrcSpan -> SrcLoc

Returns the location at the start of the SrcSpan or a "bad" SrcSpan if that is unavailable

srcSpanStartLine :: RealSrcSpan -> Int

srcSpanStartCol :: RealSrcSpan -> Int

srcSpanEnd :: SrcSpan -> SrcLoc

Returns the location at the end of the SrcSpan or a "bad" SrcSpan if that is unavailable

srcSpanEndLine :: RealSrcSpan -> Int

srcSpanEndCol :: RealSrcSpan -> Int

srcSpanFile :: RealSrcSpan -> FastString

srcLocCol :: RealSrcLoc -> Int

Raises an error when used on a "bad" SrcLoc

srcLocFile :: RealSrcLoc -> FastString

Gives the filename of the SrcLoc

srcLocLine :: RealSrcLoc -> Int

Raises an error when used on a "bad" SrcLoc

noSrcSpan :: SrcSpan

Built-in "bad" SrcSpans for common sources of location uncertainty

noSrcLoc :: SrcLoc

Built-in "bad" SrcLoc values for particular locations

noLoc :: e -> Located e

mapLoc :: (a -> b) -> GenLocated l a -> GenLocated l b

Finder

data FindResult

The result of searching for an imported module.

NB: FindResult manages both user source-import lookups (which can result in Module) as well as direct imports for interfaces (which always result in InstalledModule).

Constructors

Found ModLocation Module

The module was found

NoPackage Unit

The requested unit was not found

FoundMultiple [(Module, ModuleOrigin)]

_Error_: both in multiple packages

NotFound

Not found

Fields

• fr_paths :: [FilePath]

  Places where I looked

• fr_pkg :: Maybe Unit

  Just p => module is in this unit's manifest, but couldn't find the .hi file

• fr_mods_hidden :: [Unit]

  Module is in these units, but the *module* is hidden

• fr_pkgs_hidden :: [Unit]

  Module is in these units, but the *unit* is hidden

• fr_unusables :: [(Unit, UnusableUnitReason)]

  Module is in these units, but it is unusable

• fr_suggestions :: [ModuleSuggestion]

  Possible mis-spelled modules

mkHomeModLocation :: DynFlags -> ModuleName -> FilePath -> IO ModLocation

addBootSuffixLocnOut :: ModLocation -> ModLocation

Add the -boot suffix to all output file paths associated with the module, not including the input file itself

findObjectLinkableMaybe :: Module -> ModLocation -> IO (Maybe Linkable)

data InstalledFindResult

Constructors

InstalledFound ModLocation InstalledModule

InstalledNoPackage UnitId

InstalledNotFound [FilePath] (Maybe UnitId)

Module and Package

data ModuleOrigin

Given a module name, there may be multiple ways it came into scope, possibly simultaneously. This data type tracks all the possible ways it could have come into scope. Warning: don't use the record functions, they're partial!

Constructors

ModHidden

Module is hidden, and thus never will be available for import. (But maybe the user didn't realize), so we'll still keep track of these modules.)

ModUnusable UnusableUnitReason

Module is unavailable because the package is unusable.

ModOrigin

Module is public, and could have come from some places.

Fields

• fromOrigUnit :: Maybe Bool

  Just False means that this module is in someone's exported-modules list, but that package is hidden; Just True means that it is available; Nothing means neither applies.

• fromExposedReexport :: [UnitInfo]

  Is the module available from a reexport of an exposed package? There could be multiple.

• fromHiddenReexport :: [UnitInfo]

  Is the module available from a reexport of a hidden package?

• fromPackageFlag :: Bool

  Did the module export come from a package flag? (ToDo: track more information.

Instances

Monoid ModuleOrigin

Defined in GHC.Unit.State

Methods

mempty :: ModuleOrigin

mappend :: ModuleOrigin -> ModuleOrigin -> ModuleOrigin

mconcat :: [ModuleOrigin] -> ModuleOrigin

Semigroup ModuleOrigin

Defined in GHC.Unit.State

Methods

(<>) :: ModuleOrigin -> ModuleOrigin -> ModuleOrigin

sconcat :: NonEmpty ModuleOrigin -> ModuleOrigin

stimes :: Integral b => b -> ModuleOrigin -> ModuleOrigin

Outputable ModuleOrigin

Defined in GHC.Unit.State

Methods

ppr :: ModuleOrigin -> SDoc

newtype PackageName

Constructors

PackageName

Fields

• unPackageName :: FastString

Instances

Show PackageName

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> PackageName -> ShowS

show :: PackageName -> String

showList :: [PackageName] -> ShowS

Uniquable PackageName

Defined in GHC.Unit.Info

Methods

getUnique :: PackageName -> Unique

Outputable PackageName

Defined in GHC.Unit.Info

Methods

ppr :: PackageName -> SDoc

Eq PackageName

Defined in GHC.Unit.Info

Methods

(==) :: PackageName -> PackageName -> Bool

(/=) :: PackageName -> PackageName -> Bool

Linker

data Unlinked

Objects which have yet to be linked by the compiler

Constructors

DotO FilePath

An object file (.o)

DotA FilePath

Static archive file (.a)

DotDLL FilePath

Dynamically linked library file (.so, .dll, .dylib)

BCOs CompiledByteCode [SptEntry]

A byte-code object, lives only in memory. Also carries some static pointer table entries which should be loaded along with the BCOs. See Note [Grant plan for static forms] in GHC.Iface.Tidy.StaticPtrTable.

Instances

NFData Unlinked

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Unlinked -> ()

Outputable Unlinked

Defined in GHC.Linker.Types

Methods

ppr :: Unlinked -> SDoc

data Linkable

Information we can use to dynamically link modules into the compiler

Constructors

LM

Fields

• linkableTime :: UTCTime

  Time at which this linkable was built (i.e. when the bytecodes were produced, or the mod date on the files)

• linkableModule :: Module

  The linkable module itself

• linkableUnlinked :: [Unlinked]

  Those files and chunks of code we have yet to link.

  INVARIANT: A valid linkable always has at least one Unlinked item. If this list is empty, the Linkable represents a fake linkable, which is generated with no backend is used to avoid recompiling modules.

  ToDo: Do items get removed from this list when they get linked?

Instances

Show Linkable

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> Linkable -> ShowS

show :: Linkable -> String

showList :: [Linkable] -> ShowS

NFData Linkable

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Linkable -> ()

Outputable Linkable

Defined in GHC.Linker.Types

Methods

ppr :: Linkable -> SDoc

unload :: HscEnv -> [Linkable] -> IO ()

initDynLinker :: HscEnv -> IO ()

Hooks

data Hooks

runMetaHook :: Hooks -> Maybe (MetaHook TcM)

type MetaHook (f :: Type -> Type) = MetaRequest -> LHsExpr GhcTc -> f MetaResult

data MetaRequest

The supported metaprogramming result types

Constructors

MetaE (LHsExpr GhcPs -> MetaResult)

MetaP (LPat GhcPs -> MetaResult)

MetaT (LHsType GhcPs -> MetaResult)

MetaD ([LHsDecl GhcPs] -> MetaResult)

MetaAW (Serialized -> MetaResult)

metaRequestE :: Functor f => MetaHook f -> LHsExpr GhcTc -> f (LHsExpr GhcPs)

metaRequestP :: Functor f => MetaHook f -> LHsExpr GhcTc -> f (LPat GhcPs)

metaRequestT :: Functor f => MetaHook f -> LHsExpr GhcTc -> f (LHsType GhcPs)

metaRequestD :: Functor f => MetaHook f -> LHsExpr GhcTc -> f [LHsDecl GhcPs]

metaRequestAW :: Functor f => MetaHook f -> LHsExpr GhcTc -> f Serialized

HPT

addToHpt :: HomePackageTable -> ModuleName -> HomeModInfo -> HomePackageTable

addListToHpt :: HomePackageTable -> [(ModuleName, HomeModInfo)] -> HomePackageTable

Driver-Make

data Target

A compilation target.

A target may be supplied with the actual text of the module. If so, use this instead of the file contents (this is for use in an IDE where the file hasn't been saved by the user yet).

Constructors

Target

Fields

• targetId :: !TargetId

  module or filename

• targetAllowObjCode :: !Bool

  object code allowed?

• targetContents :: !(Maybe (InputFileBuffer, UTCTime))

  Optional in-memory buffer containing the source code GHC should use for this target instead of reading it from disk.

  Since GHC version 8.10 modules which require preprocessors such as Literate Haskell or CPP to run are also supported.

  If a corresponding source file does not exist on disk this will result in a SourceError exception if targetId = TargetModule _ is used. However together with targetId = TargetFile _ GHC will not complain about the file missing.

Instances

Outputable Target

Defined in GHC.Types.Target

Methods

ppr :: Target -> SDoc

data TargetId

Constructors

TargetModule !ModuleName

A module name: search for the file

TargetFile !FilePath !(Maybe Phase)

A filename: preprocess & parse it to find the module name. If specified, the Phase indicates how to compile this file (which phase to start from). Nothing indicates the starting phase should be determined from the suffix of the filename.

Instances

Outputable TargetId

Defined in GHC.Types.Target

Methods

ppr :: TargetId -> SDoc

Eq TargetId

Defined in GHC.Types.Target

Methods

(==) :: TargetId -> TargetId -> Bool

(/=) :: TargetId -> TargetId -> Bool

mkModuleGraph :: [ExtendedModSummary] -> ModuleGraph

GHCi

initObjLinker :: HscEnv -> IO ()

loadDLL :: HscEnv -> String -> IO (Maybe String)

data InteractiveImport

Constructors

IIDecl (ImportDecl GhcPs)

Bring the exports of a particular module (filtered by an import decl) into scope

IIModule ModuleName

Bring into scope the entire top-level envt of of this module, including the things imported into it.

Instances

Show InteractiveImport

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> InteractiveImport -> ShowS

show :: InteractiveImport -> String

showList :: [InteractiveImport] -> ShowS

Outputable InteractiveImport

Defined in GHC.Runtime.Context

Methods

ppr :: InteractiveImport -> SDoc

getContext :: GhcMonad m => m [InteractiveImport]

Get the interactive evaluation context, consisting of a pair of the set of modules from which we take the full top-level scope, and the set of modules from which we take just the exports respectively.

setContext :: GhcMonad m => [InteractiveImport] -> m ()

Set the interactive evaluation context.

(setContext imports) sets the ic_imports field (which in turn determines what is in scope at the prompt) to imports, and constructs the ic_rn_glb_env environment to reflect it.

We retain in scope all the things defined at the prompt, and kept in ic_tythings. (Indeed, they shadow stuff from ic_imports.)

parseImportDecl :: GhcMonad m => String -> m (ImportDecl GhcPs)

runDecls :: GhcMonad m => String -> m [Name]

data Warn

A command-line warning message and the reason it arose

Constructors

Warn

Fields

• warnReason :: WarnReason
• warnMsg :: Located String

ModLocation

data ModLocation

Module Location

Where a module lives on the file system: the actual locations of the .hs, .hi and .o files, if we have them.

For a module in another unit, the ml_hs_file and ml_obj_file components of ModLocation are undefined.

The locations specified by a ModLocation may or may not correspond to actual files yet: for example, even if the object file doesn't exist, the ModLocation still contains the path to where the object file will reside if/when it is created.

Instances

Show ModLocation

Defined in GHC.Unit.Module.Location

Methods

showsPrec :: Int -> ModLocation -> ShowS

show :: ModLocation -> String

showList :: [ModLocation] -> ShowS

Outputable ModLocation

Defined in GHC.Unit.Module.Location

Methods

ppr :: ModLocation -> SDoc

ml_hs_file :: ModLocation -> Maybe FilePath

The source file, if we have one. Package modules probably don't have source files.

ml_obj_file :: ModLocation -> FilePath

Where the .o file is, whether or not it exists yet. (might not exist either because the module hasn't been compiled yet, or because it is part of a unit with a .a file)

ml_hi_file :: ModLocation -> FilePath

Where the .hi file is, whether or not it exists yet. Always of form foo.hi, even if there is an hi-boot file (we add the -boot suffix later)

ml_hie_file :: ModLocation -> FilePath

Where the .hie file is, whether or not it exists yet.

DataCon

dataConExTyCoVars :: DataCon -> [TyCoVar]

The existentially-quantified type/coercion variables of the constructor including dependent (kind-) GADT equalities

Role

data Role

Constructors

Nominal

Representational

Phantom

Instances

Data Role

Defined in GHC.Core.Coercion.Axiom

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Role -> c Role

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Role

toConstr :: Role -> Constr

dataTypeOf :: Role -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Role)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Role)

gmapT :: (forall b. Data b => b -> b) -> Role -> Role

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r

gmapQ :: (forall d. Data d => d -> u) -> Role -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Role -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Role -> m Role

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role

Binary Role

Defined in GHC.Core.Coercion.Axiom

Methods

put_ :: BinHandle -> Role -> IO ()

put :: BinHandle -> Role -> IO (Bin Role)

get :: BinHandle -> IO Role

Outputable Role

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: Role -> SDoc

Eq Role

Defined in GHC.Core.Coercion.Axiom

Methods

(==) :: Role -> Role -> Bool

(/=) :: Role -> Role -> Bool

Ord Role

Defined in GHC.Core.Coercion.Axiom

Methods

compare :: Role -> Role -> Ordering

(<) :: Role -> Role -> Bool

(<=) :: Role -> Role -> Bool

(>) :: Role -> Role -> Bool

(>=) :: Role -> Role -> Bool

max :: Role -> Role -> Role

min :: Role -> Role -> Role

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

Panic

data PlainGhcException

This type is very similar to GhcException, but it omits the constructors that involve pretty-printing via SDoc. Due to the implementation of fromException for GhcException, this type can be caught as a GhcException.

Note that this should only be used for throwing exceptions, not for catching, as GhcException will not be converted to this type when catching.

Instances

Exception PlainGhcException

Defined in GHC.Utils.Panic.Plain

Methods

toException :: PlainGhcException -> SomeException

fromException :: SomeException -> Maybe PlainGhcException

displayException :: PlainGhcException -> String

Show PlainGhcException

Defined in GHC.Utils.Panic.Plain

Methods

showsPrec :: Int -> PlainGhcException -> ShowS

show :: PlainGhcException -> String

showList :: [PlainGhcException] -> ShowS

panic :: String -> a

Panics and asserts.

panicDoc :: String -> SDoc -> a

Throw an exception saying "bug in GHC"

Other

data CoreModule

A CoreModule consists of just the fields of a ModGuts that are needed for the compileToCoreModule interface.

Constructors

CoreModule

Fields

• cm_module :: !Module

  Module name

• cm_types :: !TypeEnv

  Type environment for types declared in this module

• cm_binds :: CoreProgram

  Declarations

• cm_safe :: SafeHaskellMode

  Safe Haskell mode

Instances

Show CoreModule

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> CoreModule -> ShowS

show :: CoreModule -> String

showList :: [CoreModule] -> ShowS

NFData CoreModule

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: CoreModule -> ()

Outputable CoreModule

Defined in GHC

Methods

ppr :: CoreModule -> SDoc

data SafeHaskellMode

The various Safe Haskell modes

Constructors

Sf_None

inferred unsafe

Sf_Unsafe

declared and checked

Sf_Trustworthy

declared and checked

Sf_Safe

declared and checked

Sf_SafeInferred

inferred as safe

Sf_Ignore

-fno-safe-haskell state

Instances

Show SafeHaskellMode

Defined in GHC.Types.SafeHaskell

Methods

showsPrec :: Int -> SafeHaskellMode -> ShowS

show :: SafeHaskellMode -> String

showList :: [SafeHaskellMode] -> ShowS

NFData SafeHaskellMode

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: SafeHaskellMode -> ()

Outputable SafeHaskellMode

Defined in GHC.Types.SafeHaskell

Methods

ppr :: SafeHaskellMode -> SDoc

Eq SafeHaskellMode

Defined in GHC.Types.SafeHaskell

Methods

(==) :: SafeHaskellMode -> SafeHaskellMode -> Bool

(/=) :: SafeHaskellMode -> SafeHaskellMode -> Bool

pattern GRE :: Name -> Parent -> Bool -> [ImportSpec] -> GlobalRdrElt

gre_name :: GlobalRdrElt -> Name

gre_imp :: GlobalRdrElt -> [ImportSpec]

gre_lcl :: GlobalRdrElt -> Bool

gre_par :: GlobalRdrElt -> Parent

collectHsBindsBinders :: CollectPass p => Bag (XRec p (HsBindLR p idR)) -> [IdP p]

Util Module re-exports

zipName :: Name

zipIdKey :: Unique

wordTyConKey :: Unique

wordPrimTyConKey :: Unique

wordDataConKey :: Unique

word8X64PrimTyConKey :: Unique

word8X32PrimTyConKey :: Unique

word8X16PrimTyConKey :: Unique

word8TyConName :: Name

word8TyConKey :: Unique

word8PrimTyConKey :: Unique

word8DataConKey :: Unique

word64X8PrimTyConKey :: Unique

word64X4PrimTyConKey :: Unique

word64X2PrimTyConKey :: Unique

word64TyConName :: Name

word64TyConKey :: Unique

word64PrimTyConKey :: Unique

word32X8PrimTyConKey :: Unique

word32X4PrimTyConKey :: Unique

word32X16PrimTyConKey :: Unique

word32TyConName :: Name

word32TyConKey :: Unique

word32PrimTyConKey :: Unique

word16X8PrimTyConKey :: Unique

word16X32PrimTyConKey :: Unique

word16X16PrimTyConKey :: Unique

word16TyConName :: Name

word16TyConKey :: Unique

word16PrimTyConKey :: Unique

wildCardName :: Name

wildCardKey :: Unique

weakPrimTyConKey :: Unique

voidPrimIdKey :: Unique

voidArgIdKey :: Unique

vecRepDataConKey :: Unique

vecElemTyConKey :: Unique

vecElemDataConKeys :: [Unique]

vecCountTyConKey :: Unique

vecCountDataConKeys :: [Unique]

varQual_RDR :: Module -> FastString -> RdrName

varQual :: Module -> FastString -> Unique -> Name

v1TyConName :: Name

v1TyConKey :: Unique

unsafeReflDataConName :: Name

unsafeReflDataConKey :: Unique

unsafeRangeSize_RDR :: RdrName

unsafeIndex_RDR :: RdrName

unsafeEqualityTyConName :: Name

unsafeEqualityTyConKey :: Unique

unsafeEqualityProofName :: Name

unsafeEqualityProofIdKey :: Unique

unsafeCoercePrimName :: Name

unsafeCoercePrimIdKey :: Unique

unrestrictedFunTyConKey :: Unique

unpackCString_RDR :: RdrName

unpackCStringUtf8_RDR :: RdrName

unpackCStringUtf8Name :: Name

unpackCStringUtf8IdKey :: Unique

unpackCStringName :: Name

unpackCStringIdKey :: Unique

unpackCStringFoldr_RDR :: RdrName

unpackCStringFoldrUtf8_RDR :: RdrName

unpackCStringFoldrUtf8Name :: Name

unpackCStringFoldrUtf8IdKey :: Unique

unpackCStringFoldrName :: Name

unpackCStringFoldrIdKey :: Unique

unpackCStringAppendIdKey :: Unique

unliftedTypeKindTyConKey :: Unique

unliftedRepTyConKey :: Unique

unliftedDataConKey :: Unique

unknownTyConKey :: Unique

unknown3TyConKey :: Unique

unknown2TyConKey :: Unique

unknown1TyConKey :: Unique

unboundKey :: Unique

unRec1_RDR :: RdrName

unPar1_RDR :: RdrName

unK1_RDR :: RdrName

unComp1_RDR :: RdrName

uWordTyConName :: Name

uWordTyConKey :: Unique

uWordHash_RDR :: RdrName

uWordDataCon_RDR :: RdrName

uRecTyConName :: Name

uRecTyConKey :: Unique

uNSAFE_COERCE :: Module

uIntTyConName :: Name

uIntTyConKey :: Unique

uIntHash_RDR :: RdrName

uIntDataCon_RDR :: RdrName

uFloatTyConName :: Name

uFloatTyConKey :: Unique

uFloatHash_RDR :: RdrName

uFloatDataCon_RDR :: RdrName

uDoubleTyConName :: Name

uDoubleTyConKey :: Unique

uDoubleHash_RDR :: RdrName

uDoubleDataCon_RDR :: RdrName

uCharTyConName :: Name

uCharTyConKey :: Unique

uCharHash_RDR :: RdrName

uCharDataCon_RDR :: RdrName

uAddrTyConName :: Name

uAddrTyConKey :: Unique

uAddrHash_RDR :: RdrName

uAddrDataCon_RDR :: RdrName

u1TyConName :: Name

u1TyConKey :: Unique

u1DataCon_RDR :: RdrName

typeableClassName :: Name

typeableClassKey :: Unique

typeUnconsSymbolTyFamNameKey :: Unique

typeSymbolTypeRepName :: Name

typeSymbolTypeRepKey :: Unique

typeSymbolKindConNameKey :: Unique

typeSymbolCmpTyFamNameKey :: Unique

typeSymbolAppendFamNameKey :: Unique

typeRepTyConName :: Name

typeRepTyConKey :: Unique

typeRepIdName :: Name

typeRepIdKey :: Unique

typeNatTypeRepName :: Name

typeNatTypeRepKey :: Unique

typeNatToCharTyFamNameKey :: Unique

typeNatSubTyFamNameKey :: Unique

typeNatMulTyFamNameKey :: Unique

typeNatModTyFamNameKey :: Unique

typeNatLogTyFamNameKey :: Unique

typeNatExpTyFamNameKey :: Unique

typeNatDivTyFamNameKey :: Unique

typeNatCmpTyFamNameKey :: Unique

typeNatAddTyFamNameKey :: Unique

typeLitSymbolDataConName :: Name

typeLitSymbolDataConKey :: Unique

typeLitSortTyConName :: Name

typeLitSortTyConKey :: Unique

typeLitNatDataConName :: Name

typeLitNatDataConKey :: Unique

typeLitCharDataConName :: Name

typeLitCharDataConKey :: Unique

typeLeqCharTyFamNameKey :: Unique

typeErrorVAppendDataConName :: Name

typeErrorVAppendDataConKey :: Unique

typeErrorTextDataConName :: Name

typeErrorTextDataConKey :: Unique

typeErrorShowTypeDataConName :: Name

typeErrorShowTypeDataConKey :: Unique

typeErrorIdKey :: Unique

typeErrorAppendDataConName :: Name

typeErrorAppendDataConKey :: Unique

typeConsSymbolTyFamNameKey :: Unique

typeConKey :: Unique

typeCharTypeRepName :: Name

typeCharTypeRepKey :: Unique

typeCharToNatTyFamNameKey :: Unique

typeCharKindConNameKey :: Unique

typeCharCmpTyFamNameKey :: Unique

tupleRepDataConKey :: Unique

trueDataConKey :: Unique

traverse_RDR :: RdrName

traversableClassName :: Name

traversableClassKey :: Unique

traceName :: Name

traceKey :: Unique

trTyConTyConName :: Name

trTyConTyConKey :: Unique

trTyConDataConName :: Name

trTyConDataConKey :: Unique

trTYPEKey :: Unique

trTYPE'PtrRepLiftedKey :: Unique

trRuntimeRepKey :: Unique

trNameTyConName :: Name

trNameTyConKey :: Unique

trNameSDataConName :: Name

trNameSDataConKey :: Unique

trNameDDataConName :: Name

trNameDDataConKey :: Unique

trModuleTyConName :: Name

trModuleTyConKey :: Unique

trModuleDataConName :: Name

trModuleDataConKey :: Unique

trLiftedRepKey :: Unique

trGhcPrimModuleName :: Name

trGhcPrimModuleKey :: Unique

tr'PtrRepLiftedKey :: Unique

to_RDR :: RdrName

toRational_RDR :: RdrName

toRationalName :: Name

toRationalClassOpKey :: Unique

toList_RDR :: RdrName

toListName :: Name

toListClassOpKey :: Unique

toInteger_RDR :: RdrName

toIntegerName :: Name

toIntegerClassOpKey :: Unique

toEnum_RDR :: RdrName

toDynName :: Name

toDynIdKey :: Unique

toAnnotationWrapperName :: Name

toAnnotationWrapperIdKey :: Unique

to1_RDR :: RdrName

times_RDR :: RdrName

threadIdPrimTyConKey :: Unique

thenMName :: Name

thenMClassOpKey :: Unique

thenIOName :: Name

thenIOIdKey :: Unique

thenAName :: Name

thenAClassOpKey :: Unique

tcQual_RDR :: Module -> FastString -> RdrName

tcQual :: Module -> FastString -> Unique -> Name

tYPETyConKey :: Unique

tYPEABLE_INTERNAL :: Module

tYPEABLE :: Module

tVarPrimTyConKey :: Unique

symbol_RDR :: RdrName

sumTyConName :: Name

sumTyConKey :: Unique

sumRepDataConKey :: Unique

succ_RDR :: RdrName

stringTyConKey :: Unique

step_RDR :: RdrName

staticPtrTyConName :: Name

staticPtrTyConKey :: Unique

staticPtrInfoTyConName :: Name

staticPtrInfoTyConKey :: Unique

staticPtrInfoDataConName :: Name

staticPtrInfoDataConKey :: Unique

staticPtrDataConName :: Name

staticPtrDataConKey :: Unique

statePrimTyConKey :: Unique

starKindRepName :: Name

starKindRepKey :: Unique

starArrStarKindRepName :: Name

starArrStarKindRepKey :: Unique

starArrStarArrStarKindRepName :: Name

starArrStarArrStarKindRepKey :: Unique

standardClassKeys :: [Unique]

stablePtrTyConName :: Name

stablePtrTyConKey :: Unique

stablePtrPrimTyConKey :: Unique

stableNameTyConKey :: Unique

stableNamePrimTyConKey :: Unique

stableNameDataConKey :: Unique

srcLocDataConName :: Name

srcLocDataConKey :: Unique

specTyConName :: Name

specTyConKey :: Unique

sourceUnpackDataConName :: Name

sourceUnpackDataConKey :: Unique

sourceStrictDataConName :: Name

sourceStrictDataConKey :: Unique

sourceNoUnpackDataConName :: Name

sourceNoUnpackDataConKey :: Unique

sourceLazyDataConName :: Name

sourceLazyDataConKey :: Unique

someTypeRepTyConName :: Name

someTypeRepTyConKey :: Unique

someTypeRepDataConName :: Name

someTypeRepDataConKey :: Unique

sndName :: Name

sndIdKey :: Unique

smallMutableArrayPrimTyConKey :: Unique

smallArrayPrimTyConKey :: Unique

shows_RDR :: RdrName

showsPrec_RDR :: RdrName

showString_RDR :: RdrName

showSpace_RDR :: RdrName

showParen_RDR :: RdrName

showCommaSpace_RDR :: RdrName

showClassName :: Name

showClassKey :: Unique

setFieldName :: Name

setFieldClassOpKey :: Unique

seqIdKey :: Unique

semigroupClassName :: Name

semigroupClassKey :: Unique

selectorClassName :: Name

selectorClassKey :: Unique

selName_RDR :: RdrName

sappendName :: Name

sappendClassOpKey :: Unique

sYSTEM_IO :: Module

sTyConName :: Name

sTyConKey :: Unique

s1TyConName :: Name

s1TyConKey :: Unique

runtimeRepTyConKey :: Unique

runtimeRepSimpleDataConKeys :: [Unique]

runtimeErrorIdKey :: Unique

runRWName :: Name

runRWKey :: Unique

runMainKey :: Unique

runMainIOName :: Name

rootMainKey :: Unique

right_RDR :: RdrName

rightSectionKey :: Unique

rightDataConName :: Name

rightDataConKey :: Unique

rightAssociativeDataConName :: Name

rightAssociativeDataConKey :: Unique

rightAssocDataCon_RDR :: RdrName

returnM_RDR :: RdrName

returnMName :: Name

returnMClassOpKey :: Unique

returnIO_RDR :: RdrName

returnIOName :: Name

returnIOIdKey :: Unique

reset_RDR :: RdrName

replace_RDR :: RdrName

repTyConName :: Name

repTyConKey :: Unique

rep1TyConName :: Name

rep1TyConKey :: Unique

recSelErrorIdKey :: Unique

recConErrorIdKey :: Unique

rec1TyConName :: Name

rec1TyConKey :: Unique

rec1DataCon_RDR :: RdrName

rec0TyConName :: Name

rec0TyConKey :: Unique

realWorldTyConKey :: Unique

realWorldPrimIdKey :: Unique

realToFracName :: Name

realToFracIdKey :: Unique

realFracClassName :: Name

realFracClassKey :: Unique

realFloatClassName :: Name

realFloatClassKey :: Unique

realClassName :: Name

realClassKey :: Unique

readSymField_RDR :: RdrName

readPrec_RDR :: RdrName

readList_RDR :: RdrName

readListPrec_RDR :: RdrName

readListPrecDefault_RDR :: RdrName

readListDefault_RDR :: RdrName

readField_RDR :: RdrName

readFieldHash_RDR :: RdrName

readClassName :: Name

readClassKey :: Unique

rationalTyConName :: Name

rationalTyConKey :: Unique

rationalToFloatName :: Name

rationalToFloatIdKey :: Unique

rationalToDoubleName :: Name

rationalToDoubleIdKey :: Unique

ratioTyConName :: Name

ratioTyConKey :: Unique

ratioDataCon_RDR :: RdrName

ratioDataConName :: Name

ratioDataConKey :: Unique

range_RDR :: RdrName

randomGenClassName :: Name

randomGenClassKey :: Unique

randomClassName :: Name

randomClassKey :: Unique

raiseUnderflowIdKey :: Unique

raiseOverflowIdKey :: Unique

raiseDivZeroIdKey :: Unique

rTyConName :: Name

rTyConKey :: Unique

rOOT_MAIN :: Module

rEAD_PREC :: Module

rANDOM :: Module

r1DataCon_RDR :: RdrName

pushCallStackName :: Name

pushCallStackKey :: Unique

pure_RDR :: RdrName

pureAName :: Name

pureAClassOpKey :: Unique

punc_RDR :: RdrName

ptrTyConName :: Name

ptrTyConKey :: Unique

proxyPrimTyConKey :: Unique

proxyHashKey :: Unique

prodTyConName :: Name

prodTyConKey :: Unique

prodDataCon_RDR :: RdrName

printIdKey :: Unique

pretendNameIsInScope :: Name -> Bool

prefixIDataConName :: Name

prefixIDataConKey :: Unique

prefixDataCon_RDR :: RdrName

pred_RDR :: RdrName

prec_RDR :: RdrName

plus_RDR :: RdrName

pluginTyConName :: Name

pluginTyConKey :: Unique

pfail_RDR :: RdrName

patErrorIdKey :: Unique

parens_RDR :: RdrName

par1TyConName :: Name

par1TyConKey :: Unique

par1DataCon_RDR :: RdrName

packageName_RDR :: RdrName

pRELUDE_NAME :: ModuleName

pRELUDE :: Module

pLUGINS :: Module

otherwiseIdName :: Name

otherwiseIdKey :: Unique

orderingTyConName :: Name

orderingTyConKey :: Unique

ordLTDataConName :: Name

ordLTDataConKey :: Unique

ordGTDataConName :: Name

ordGTDataConKey :: Unique

ordEQDataConName :: Name

ordEQDataConKey :: Unique

ordClass_RDR :: RdrName

ordClassName :: Name

ordClassKey :: Unique

opaqueTyConName :: Name

opaqueTyConKey :: Unique

oneShotKey :: Unique

oneDataConKey :: Unique

numericClassKeys :: [Unique]

numClass_RDR :: RdrName

numClassName :: Name

numClassKey :: Unique

null_RDR :: RdrName

nullAddrIdKey :: Unique

nothingDataConKey :: Unique

not_RDR :: RdrName

notAssociativeDataConName :: Name

notAssociativeDataConKey :: Unique

notAssocDataCon_RDR :: RdrName

nonExhaustiveGuardsErrorIdKey :: Unique

nonEmptyTyConKey :: Unique

nonEmptyDataConKey :: Unique

noinlineIdKey :: Unique

noSourceUnpackednessDataConName :: Name

noSourceUnpackednessDataConKey :: Unique

noSourceStrictnessDataConName :: Name

noSourceStrictnessDataConKey :: Unique

noSelTyConName :: Name

noSelTyConKey :: Unique

noMethodBindingErrorIdKey :: Unique

nilDataConKey :: Unique

newStablePtr_RDR :: RdrName

newStablePtrName :: Name

newStablePtrIdKey :: Unique

negateName :: Name

negateClassOpKey :: Unique

naturalXorName :: Name

naturalXorIdKey :: Unique

naturalTyConKey :: Unique

naturalToWordName :: Name

naturalToWordIdKey :: Unique

naturalToWordClampName :: Name

naturalToWordClampIdKey :: Unique

naturalToFloatName :: Name

naturalToFloatIdKey :: Unique

naturalToDoubleName :: Name

naturalToDoubleIdKey :: Unique

naturalTestBitName :: Name

naturalTestBitIdKey :: Unique

naturalSubUnsafeName :: Name

naturalSubUnsafeIdKey :: Unique

naturalSubThrowName :: Name

naturalSubThrowIdKey :: Unique

naturalSubName :: Name

naturalSubIdKey :: Unique

naturalSizeInBaseName :: Name

naturalSizeInBaseIdKey :: Unique

naturalSignumName :: Name

naturalSignumIdKey :: Unique

naturalShiftRName :: Name

naturalShiftRIdKey :: Unique

naturalShiftLName :: Name

naturalShiftLIdKey :: Unique

naturalRemName :: Name

naturalRemIdKey :: Unique

naturalQuotRemName :: Name

naturalQuotRemIdKey :: Unique

naturalQuotName :: Name

naturalQuotIdKey :: Unique

naturalPowModName :: Name

naturalPowModIdKey :: Unique

naturalPopCountName :: Name

naturalPopCountIdKey :: Unique

naturalOrName :: Name

naturalOrIdKey :: Unique

naturalNegateName :: Name

naturalNegateIdKey :: Unique

naturalNeName :: Name

naturalNeIdKey :: Unique

naturalNSDataConKey :: Unique

naturalNBDataConKey :: Unique

naturalMulName :: Name

naturalMulIdKey :: Unique

naturalLtName :: Name

naturalLtIdKey :: Unique

naturalLogBaseWordName :: Name

naturalLogBaseWordIdKey :: Unique

naturalLogBaseName :: Name

naturalLogBaseIdKey :: Unique

naturalLog2Name :: Name

naturalLog2IdKey :: Unique

naturalLeName :: Name

naturalLeIdKey :: Unique

naturalLcmName :: Name

naturalLcmIdKey :: Unique

naturalGtName :: Name

naturalGtIdKey :: Unique

naturalGeName :: Name

naturalGeIdKey :: Unique

naturalGcdName :: Name

naturalGcdIdKey :: Unique

naturalEqName :: Name

naturalEqIdKey :: Unique

naturalCompareName :: Name

naturalCompareIdKey :: Unique

naturalBitName :: Name

naturalBitIdKey :: Unique

naturalAndNotName :: Name

naturalAndNotIdKey :: Unique

naturalAndName :: Name

naturalAndIdKey :: Unique

naturalAddName :: Name

naturalAddIdKey :: Unique

mzipName :: Name

mzipIdKey :: Unique

mutableByteArrayPrimTyConKey :: Unique

mutableArrayPrimTyConKey :: Unique

mutableArrayArrayPrimTyConKey :: Unique

mutVarPrimTyConKey :: Unique

multiplicityTyConKey :: Unique

multMulTyConKey :: Unique

monoidClassName :: Name

monoidClassKey :: Unique

monadPlusClassName :: Name

monadPlusClassKey :: Unique

monadFixClassName :: Name

monadFixClassKey :: Unique

monadFailClassName :: Name

monadFailClassKey :: Unique

monadClass_RDR :: RdrName

monadClassName :: Name

monadClassKey :: Unique

moduleName_RDR :: RdrName

modIntName :: Name

modIntIdKey :: Unique

mk_known_key_name :: NameSpace -> Module -> FastString -> Unique -> Name

mkUnboundName :: OccName -> Name

mkTyConKey :: Unique

mkTrTypeName :: Name

mkTrTypeKey :: Unique

mkTrFunName :: Name

mkTrFunKey :: Unique

mkTrConName :: Name

mkTrConKey :: Unique

mkTrAppName :: Name

mkTrAppKey :: Unique

mkThisGhcModule_ :: ModuleName -> Module

mkThisGhcModule :: FastString -> Module

mkRationalBase2Name :: Name

mkRationalBase2IdKey :: Unique

mkRationalBase10Name :: Name

mkRationalBase10IdKey :: Unique

mkPrimModule :: FastString -> Module

mkMainModule_ :: ModuleName -> Module

mkMainModule :: FastString -> Module

mkInteractiveModule :: Int -> Module

mkBignumModule :: FastString -> Module

mkBaseModule_ :: ModuleName -> Module

mkBaseModule :: FastString -> Module

minus_RDR :: RdrName

minusName :: Name

minusClassOpKey :: Unique

minBound_RDR :: RdrName

mfixName :: Name

mfixIdKey :: Unique

metaSelDataConName :: Name

metaSelDataConKey :: Unique

metaDataDataConName :: Name

metaDataDataConKey :: Unique

metaConsDataConName :: Name

metaConsDataConKey :: Unique

mempty_RDR :: RdrName

memptyName :: Name

memptyClassOpKey :: Unique

mconcatName :: Name

mconcatClassOpKey :: Unique

maybeTyConKey :: Unique

maxBound_RDR :: RdrName

mappend_RDR :: RdrName

mappendName :: Name

mappendClassOpKey :: Unique

map_RDR :: RdrName

mapName :: Name

mapIdKey :: Unique

manyDataConKey :: Unique

makeStaticName :: Name

makeStaticKey :: Unique

main_RDR_Unqual :: RdrName

magicDictKey :: Unique

mVarPrimTyConKey :: Unique

mONAD_ZIP :: Module

mONAD_FIX :: Module

mONAD_FAIL :: Module

mONAD :: Module

mAIN_NAME :: ModuleName

m1TyConName :: Name

m1TyConKey :: Unique

m1DataCon_RDR :: RdrName

lt_RDR :: RdrName

ltTag_RDR :: RdrName

loopAName :: Name

loopAIdKey :: Unique

listTyConKey :: Unique

liftedTypeKindTyConKey :: Unique

liftedRepTyConKey :: Unique

liftedDataConKey :: Unique

liftMName :: Name

liftMIdKey :: Unique

liftA2_RDR :: RdrName

lexP_RDR :: RdrName

levityTyConKey :: Unique

left_RDR :: RdrName

leftSectionKey :: Unique

leftDataConName :: Name

leftDataConKey :: Unique

leftAssociativeDataConName :: Name

leftAssociativeDataConKey :: Unique

leftAssocDataCon_RDR :: RdrName

le_RDR :: RdrName

lazyIdKey :: Unique

lEX :: Module

l1DataCon_RDR :: RdrName

knownSymbolClassNameKey :: Unique

knownSymbolClassName :: Name

knownNatClassNameKey :: Unique

knownNatClassName :: Name

knownCharClassNameKey :: Unique

knownCharClassName :: Name

kindRepVarDataConName :: Name

kindRepVarDataConKey :: Unique

kindRepTypeLitSDataConName :: Name

kindRepTypeLitSDataConKey :: Unique

kindRepTypeLitDDataConName :: Name

kindRepTypeLitDDataConKey :: Unique

kindRepTyConName :: Name

kindRepTyConKey :: Unique

kindRepTyConAppDataConName :: Name

kindRepTyConAppDataConKey :: Unique

kindRepTYPEDataConName :: Name

kindRepTYPEDataConKey :: Unique

kindRepFunDataConName :: Name

kindRepFunDataConKey :: Unique

kindRepAppDataConName :: Name

kindRepAppDataConKey :: Unique

kindConKey :: Unique

k1TyConName :: Name

k1TyConKey :: Unique

k1DataCon_RDR :: RdrName

justDataConKey :: Unique

joinMName :: Name

joinMIdKey :: Unique

ixClassName :: Name

ixClassKey :: Unique

itName :: Unique -> SrcSpan -> Name

isUnboundName :: Name -> Bool

isStringClassName :: Name

isStringClassKey :: Unique

isNewtypeName_RDR :: RdrName

isListClassName :: Name

isListClassKey :: Unique

ipClassName :: Name

ipClassKey :: Unique

ioTyConName :: Name

ioTyConKey :: Unique

ioPortPrimTyConKey :: Unique

ioDataCon_RDR :: RdrName

ioDataConName :: Name

ioDataConKey :: Unique

interactiveClassNames :: [Name]

interactiveClassKeys :: [Unique]

integralClassName :: Name

integralClassKey :: Unique

integerXorName :: Name

integerXorIdKey :: Unique

integerTyConKey :: Unique

integerToWordName :: Name

integerToWordIdKey :: Unique

integerToWord64Name :: Name

integerToWord64IdKey :: Unique

integerToNaturalThrowName :: Name

integerToNaturalThrowIdKey :: Unique

integerToNaturalName :: Name

integerToNaturalIdKey :: Unique

integerToNaturalClampName :: Name

integerToNaturalClampIdKey :: Unique

integerToIntName :: Name

integerToIntIdKey :: Unique

integerToInt64Name :: Name

integerToInt64IdKey :: Unique

integerToFloatName :: Name

integerToFloatIdKey :: Unique

integerToDoubleName :: Name

integerToDoubleIdKey :: Unique

integerTestBitName :: Name

integerTestBitIdKey :: Unique

integerSubName :: Name

integerSubIdKey :: Unique

integerSignumName :: Name

integerSignumIdKey :: Unique

integerShiftRName :: Name

integerShiftRIdKey :: Unique

integerShiftLName :: Name

integerShiftLIdKey :: Unique

integerRemName :: Name

integerRemIdKey :: Unique

integerQuotRemName :: Name

integerQuotRemIdKey :: Unique

integerQuotName :: Name

integerQuotIdKey :: Unique

integerPopCountName :: Name

integerPopCountIdKey :: Unique

integerOrName :: Name

integerOrIdKey :: Unique

integerNegateName :: Name

integerNegateIdKey :: Unique

integerNeName :: Name

integerNeIdKey :: Unique

integerMul_RDR :: RdrName

integerMulName :: Name

integerMulIdKey :: Unique

integerModName :: Name

integerModIdKey :: Unique

integerLtName :: Name

integerLtIdKey :: Unique

integerLeName :: Name

integerLeIdKey :: Unique

integerLcmName :: Name

integerLcmIdKey :: Unique

integerISDataConKey :: Unique

integerIPDataConKey :: Unique

integerINDataConKey :: Unique

integerGtName :: Name

integerGtIdKey :: Unique

integerGeName :: Name

integerGeIdKey :: Unique

integerGcdName :: Name

integerGcdIdKey :: Unique

integerFromWordName :: Name

integerFromWordIdKey :: Unique

integerFromWord64Name :: Name

integerFromWord64IdKey :: Unique

integerFromNaturalName :: Name

integerFromNaturalIdKey :: Unique

integerFromInt64Name :: Name

integerFromInt64IdKey :: Unique

integerEqName :: Name

integerEqIdKey :: Unique

integerEncodeFloatName :: Name

integerEncodeFloatIdKey :: Unique

integerEncodeDoubleName :: Name

integerEncodeDoubleIdKey :: Unique

integerDivName :: Name

integerDivModName :: Name

integerDivModIdKey :: Unique

integerDivIdKey :: Unique

integerComplementName :: Name

integerComplementIdKey :: Unique

integerCompareName :: Name

integerCompareIdKey :: Unique

integerBitName :: Name

integerBitIdKey :: Unique

integerAndName :: Name

integerAndIdKey :: Unique

integerAdd_RDR :: RdrName

integerAddName :: Name

integerAddIdKey :: Unique

integerAbsName :: Name

integerAbsIdKey :: Unique

intTyConKey :: Unique

intPrimTyConKey :: Unique

intDataConKey :: Unique

int8X64PrimTyConKey :: Unique

int8X32PrimTyConKey :: Unique

int8X16PrimTyConKey :: Unique

int8TyConName :: Name

int8TyConKey :: Unique

int8PrimTyConKey :: Unique

int64X8PrimTyConKey :: Unique

int64X4PrimTyConKey :: Unique

int64X2PrimTyConKey :: Unique

int64TyConName :: Name

int64TyConKey :: Unique

int64PrimTyConKey :: Unique

int32X8PrimTyConKey :: Unique

int32X4PrimTyConKey :: Unique

int32X16PrimTyConKey :: Unique

int32TyConName :: Name

int32TyConKey :: Unique

int32PrimTyConKey :: Unique

int16X8PrimTyConKey :: Unique

int16X32PrimTyConKey :: Unique

int16X16PrimTyConKey :: Unique

int16TyConName :: Name

int16TyConKey :: Unique

int16PrimTyConKey :: Unique

inrDataConKey :: Unique

inlineIdName :: Name

inlineIdKey :: Unique

inlDataConKey :: Unique

infixIDataConName :: Name

infixIDataConKey :: Unique

infixDataCon_RDR :: RdrName

index_RDR :: RdrName

inRange_RDR :: RdrName

ident_RDR :: RdrName

heqTyConKey :: Unique

heqSCSelIdKey :: Unique

heqDataConKey :: Unique

hasFieldClassNameKey :: Unique

hasFieldClassName :: Name

guardMName :: Name

guardMIdKey :: Unique

gt_RDR :: RdrName

gtTag_RDR :: RdrName

groupWithName :: Name

groupWithIdKey :: Unique

ghciStepIoMName :: Name

ghciStepIoMClassOpKey :: Unique

ghciIoClassName :: Name

ghciIoClassKey :: Unique

getTag_RDR :: RdrName

getFieldName :: Name

getFieldClassOpKey :: Unique

genericTyConNames :: [Name]

genericClassNames :: [Name]

genUnitDataConKey :: Unique

genClassName :: Name

genClassKey :: Unique

gen1ClassName :: Name

gen1ClassKey :: Unique

ge_RDR :: RdrName

geName :: Name

geClassOpKey :: Unique

gHC_WORD :: Module

gHC_TYPES :: Module

gHC_TYPENATS_INTERNAL :: Module

gHC_TYPENATS :: Module

gHC_TYPELITS_INTERNAL :: Module

gHC_TYPELITS :: Module

gHC_TUPLE :: Module

gHC_TOP_HANDLER :: Module

gHC_STATICPTR_INTERNAL :: Module

gHC_STATICPTR :: Module

gHC_STACK_TYPES :: Module

gHC_STACK :: Module

gHC_STABLE :: Module

gHC_ST :: Module

gHC_SRCLOC :: Module

gHC_SHOW :: Module

gHC_RECORDS :: Module

gHC_REAL :: Module

gHC_READ :: Module

gHC_PTR :: Module

gHC_PRIM_PANIC :: Module

gHC_PRIM_EXCEPTION :: Module

gHC_PRIMOPWRAPPERS :: Module

gHC_PRIM :: Module

gHC_OVER_LABELS :: Module

gHC_NUM_NATURAL :: Module

gHC_NUM_INTEGER :: Module

gHC_NUM_BIGNAT :: Module

gHC_NUM :: Module

gHC_MAYBE :: Module

gHC_MAGIC :: Module

gHC_LIST :: Module

gHC_IX :: Module

gHC_IO_Exception :: Module

gHC_IO :: Module

gHC_INT :: Module

gHC_GHCI_HELPERS :: Module

gHC_GHCI :: Module

gHC_GENERICS :: Module

gHC_FLOAT :: Module

gHC_FINGERPRINT_TYPE :: Module

gHC_EXTS :: Module

gHC_ERR :: Module

gHC_ENUM :: Module

gHC_DESUGAR :: Module

gHC_CSTRING :: Module

gHC_CONC :: Module

gHC_CLASSES :: Module

gHC_BASE :: Module

gENERICS :: Module

functorClassName :: Name

functorClassKey :: Unique

funTyConKey :: Unique

funPtrTyConName :: Name

funPtrTyConKey :: Unique

fstName :: Name

fstIdKey :: Unique

frontendPluginTyConName :: Name

frontendPluginTyConKey :: Unique

from_RDR :: RdrName

fromString_RDR :: RdrName

fromStringName :: Name

fromStringClassOpKey :: Unique

fromStaticPtrName :: Name

fromStaticPtrClassOpKey :: Unique

fromRational_RDR :: RdrName

fromRationalName :: Name

fromRationalClassOpKey :: Unique

fromList_RDR :: RdrName

fromListName :: Name

fromListN_RDR :: RdrName

fromListNName :: Name

fromListNClassOpKey :: Unique

fromListClassOpKey :: Unique

fromLabelClassOpName :: Name

fromLabelClassOpKey :: Unique

fromIntegral_RDR :: RdrName

fromIntegralName :: Name

fromIntegralIdKey :: Unique

fromInteger_RDR :: RdrName

fromIntegerName :: Name

fromIntegerClassOpKey :: Unique

fromEnum_RDR :: RdrName

from1_RDR :: RdrName

fractionalClassName :: Name

fractionalClassKeys :: [Unique]

fractionalClassKey :: Unique

foreignObjPrimTyConKey :: Unique

foldr_RDR :: RdrName

foldrName :: Name

foldrIdKey :: Unique

foldable_foldr_RDR :: RdrName

foldableClassName :: Name

foldableClassKey :: Unique

foldMap_RDR :: RdrName

fmap_RDR :: RdrName

fmapName :: Name

fmapClassOpKey :: Unique

floatingClassName :: Name

floatingClassKey :: Unique

floatX8PrimTyConKey :: Unique

floatX4PrimTyConKey :: Unique

floatX16PrimTyConKey :: Unique

floatTyConKey :: Unique

floatPrimTyConKey :: Unique

floatDataConKey :: Unique

firstAName :: Name

firstAIdKey :: Unique

fingerprintDataConName :: Name

fingerprintDataConKey :: Unique

filterName :: Name

filterIdKey :: Unique

falseDataConKey :: Unique

failM_RDR :: RdrName

failMName :: Name

failMClassOpKey :: Unique

failIOName :: Name

failIOIdKey :: Unique

expectP_RDR :: RdrName

error_RDR :: RdrName

errorMessageTypeErrorFamName :: Name

errorMessageTypeErrorFamKey :: Unique

errorIdKey :: Unique

eq_RDR :: RdrName

eqTyConKey :: Unique

eqTag_RDR :: RdrName

eqString_RDR :: RdrName

eqStringName :: Name

eqStringIdKey :: Unique

eqSCSelIdKey :: Unique

eqReprPrimTyConKey :: Unique

eqPrimTyConKey :: Unique

eqPhantPrimTyConKey :: Unique

eqName :: Name

eqDataConKey :: Unique

eqClass_RDR :: RdrName

eqClassOpKey :: Unique

eqClassName :: Name

eqClassKey :: Unique

enumFrom_RDR :: RdrName

enumFromTo_RDR :: RdrName

enumFromToName :: Name

enumFromToClassOpKey :: Unique

enumFromThen_RDR :: RdrName

enumFromThenTo_RDR :: RdrName

enumFromThenToName :: Name

enumFromThenToClassOpKey :: Unique

enumFromThenName :: Name

enumFromThenClassOpKey :: Unique

enumFromName :: Name

enumFromClassOpKey :: Unique

enumClass_RDR :: RdrName

enumClassName :: Name

enumClassKey :: Unique

emptyCallStackName :: Name

emptyCallStackKey :: Unique

eitherTyConName :: Name

eitherTyConKey :: Unique

doubleX8PrimTyConKey :: Unique

doubleX4PrimTyConKey :: Unique

doubleX2PrimTyConKey :: Unique

doubleTyConKey :: Unique

doublePrimTyConKey :: Unique

doubleDataConKey :: Unique

dollarName :: Name

dollarIdKey :: Unique

divIntName :: Name

divIntIdKey :: Unique

derivableClassKeys :: [Unique]

decidedUnpackDataConName :: Name

decidedUnpackDataConKey :: Unique

decidedStrictDataConName :: Name

decidedStrictDataConKey :: Unique

decidedLazyDataConName :: Name

decidedLazyDataConKey :: Unique

dcQual :: Module -> FastString -> Unique -> Name

datatypeName_RDR :: RdrName

datatypeClassName :: Name

datatypeClassKey :: Unique

dataToTag_RDR :: RdrName

dataQual_RDR :: Module -> FastString -> RdrName

dataClassName :: Name

dataClassKey :: Unique

dYNAMIC :: Module

dTyConName :: Name

dTyConKey :: Unique

dEBUG_TRACE :: Module

dATA_TYPE_EQUALITY :: Module

dATA_TUPLE :: Module

dATA_TRAVERSABLE :: Module

dATA_STRING :: Module

dATA_LIST :: Module

dATA_FOLDABLE :: Module

dATA_EITHER :: Module

dATA_COERCE :: Module

dATA_ARRAY_PARALLEL_PRIM_NAME :: ModuleName

dATA_ARRAY_PARALLEL_NAME :: ModuleName

d1TyConName :: Name

d1TyConKey :: Unique

cstringLengthName :: Name

cstringLengthIdKey :: Unique

crossDataConKey :: Unique

constructorClassName :: Name

constructorClassKey :: Unique

constraintKindTyConKey :: Unique

considerAccessibleName :: Name

considerAccessibleIdKey :: Unique

consDataConKey :: Unique

concatName :: Name

concatIdKey :: Unique

conName_RDR :: RdrName

conIsRecord_RDR :: RdrName

conFixity_RDR :: RdrName

compose_RDR :: RdrName

composeAName :: Name

composeAIdKey :: Unique

compare_RDR :: RdrName

compactPrimTyConKey :: Unique

compTyConName :: Name

compTyConKey :: Unique

comp1DataCon_RDR :: RdrName

coercionTokenIdKey :: Unique

coercibleTyConKey :: Unique

coercibleSCSelIdKey :: Unique

coercibleDataConKey :: Unique

coerceKey :: Unique

clsQual_RDR :: Module -> FastString -> RdrName

clsQual :: Module -> FastString -> Unique -> Name

choose_RDR :: RdrName

choiceAName :: Name

choiceAIdKey :: Unique

charTyConKey :: Unique

charPrimTyConKey :: Unique

charDataConKey :: Unique

callStackTyConName :: Name

callStackTyConKey :: Unique

cTyConName :: Name

cTyConKey :: Unique

cONTROL_EXCEPTION_BASE :: Module

cONTROL_APPLICATIVE :: Module

c1TyConName :: Name

c1TyConKey :: Unique

byteArrayPrimTyConKey :: Unique

build_RDR :: RdrName

buildName :: Name

buildIdKey :: Unique

breakpointName :: Name

breakpointIdKey :: Unique

breakpointCondName :: Name

breakpointCondIdKey :: Unique

boxityConKey :: Unique

boxedRepDataConKey :: Unique

boundedClassName :: Name

boundedClassKey :: Unique

boolTyConKey :: Unique

bnnVarQual :: String -> Unique -> Name

bniVarQual :: String -> Unique -> Name

bnbVarQual :: String -> Unique -> Name

bitIntegerIdKey :: Unique

bindM_RDR :: RdrName

bindMName :: Name

bindMClassOpKey :: Unique

bindIO_RDR :: RdrName

bindIOName :: Name

bindIOIdKey :: Unique

bignatFromWordListName :: Name

bignatFromWordListIdKey :: Unique

bcoPrimTyConKey :: Unique

basicKnownKeyNames :: [Name]

augmentName :: Name

augmentIdKey :: Unique

assertName :: Name

assertIdKey :: Unique

assertErrorName :: Name

assertErrorIdKey :: Unique

arrayPrimTyConKey :: Unique

arrayArrayPrimTyConKey :: Unique

arrAName :: Name

arrAIdKey :: Unique

applicativeClassName :: Name

applicativeClassKey :: Unique

append_RDR :: RdrName

appendName :: Name

appendIdKey :: Unique

appAName :: Name

appAIdKey :: Unique

ap_RDR :: RdrName

apAName :: Name

apAClassOpKey :: Unique

anyTyConKey :: Unique

anyBoxConKey :: Unique

and_RDR :: RdrName

alternativeClassName :: Name

alternativeClassKey :: Unique

alt_RDR :: RdrName

all_RDR :: RdrName

allNameStrings :: [String]

addrPrimTyConKey :: Unique

absentSumFieldErrorIdKey :: Unique

absentErrorIdKey :: Unique

aRROW :: Module

class Uniquable a where

Class of things that we can obtain a Unique from

Methods

getUnique :: a -> Unique

Instances

Uniquable Label

Defined in GHC.Cmm.Dataflow.Label

Methods

getUnique :: Label -> Unique

Uniquable LocalReg

Defined in GHC.Cmm.Expr

Methods

getUnique :: LocalReg -> Unique

Uniquable Class

Defined in GHC.Core.Class

Methods

getUnique :: Class -> Unique

Uniquable CoAxiomRule

Defined in GHC.Core.Coercion.Axiom

Methods

getUnique :: CoAxiomRule -> Unique

Uniquable ConLike

Defined in GHC.Core.ConLike

Methods

getUnique :: ConLike -> Unique

Uniquable DataCon

Defined in GHC.Core.DataCon

Methods

getUnique :: DataCon -> Unique

Uniquable PatSyn

Defined in GHC.Core.PatSyn

Methods

getUnique :: PatSyn -> Unique

Uniquable CoercionHole

Defined in GHC.Core.TyCo.Rep

Methods

getUnique :: CoercionHole -> Unique

Uniquable TyCon

Defined in GHC.Core.TyCon

Methods

getUnique :: TyCon -> Unique

Uniquable FastString

Defined in GHC.Types.Unique

Methods

getUnique :: FastString -> Unique

Uniquable EvBindsVar

Defined in GHC.Tc.Types.Evidence

Methods

getUnique :: EvBindsVar -> Unique

Uniquable Name

Defined in GHC.Types.Name

Methods

getUnique :: Name -> Unique

Uniquable OccName

Defined in GHC.Types.Name.Occurrence

Methods

getUnique :: OccName -> Unique

Uniquable Unique

Defined in GHC.Types.Unique

Methods

getUnique :: Unique -> Unique

Uniquable Var

Defined in GHC.Types.Var

Methods

getUnique :: Var -> Unique

Uniquable PackageId

Defined in GHC.Unit.Info

Methods

getUnique :: PackageId -> Unique

Uniquable PackageName

Defined in GHC.Unit.Info

Methods

getUnique :: PackageName -> Unique

Uniquable ModuleName

Defined in GHC.Unit.Module.Name

Methods

getUnique :: ModuleName -> Unique

Uniquable Module

Defined in GHC.Unit.Types

Methods

getUnique :: Module -> Unique

Uniquable UnitId

Defined in GHC.Unit.Types

Methods

getUnique :: UnitId -> Unique

Uniquable Int

Defined in GHC.Types.Unique

Methods

getUnique :: Int -> Unique

Uniquable (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

getUnique :: CoAxiom br -> Unique

Uniquable unit => Uniquable (Definite unit)

Defined in GHC.Unit.Types

Methods

getUnique :: Definite unit -> Unique

IsUnitId u => Uniquable (GenUnit u)

Defined in GHC.Unit.Types

Methods

getUnique :: GenUnit u -> Unique

Uniquable unit => Uniquable (Indefinite unit)

Defined in GHC.Unit.Types

Methods

getUnique :: Indefinite unit -> Unique

hasKey :: Uniquable a => a -> Unique -> Bool

module GHC.Builtin.Types

module GHC.Builtin.Types.Prim

module GHC.Builtin.Utils

module GHC.Core.Class

module GHC.Core.Coercion

module GHC.Core.ConLike

data StrictnessMark

Constructors

MarkedStrict

NotMarkedStrict

Instances

Outputable StrictnessMark

Defined in GHC.Core.DataCon

Methods

ppr :: StrictnessMark -> SDoc

data SrcUnpackedness

Source Unpackedness

What unpackedness the user requested

Constructors

SrcUnpack

{-# UNPACK #-} specified

SrcNoUnpack

{-# NOUNPACK #-} specified

NoSrcUnpack

no unpack pragma

Instances

Data SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcUnpackedness -> c SrcUnpackedness

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcUnpackedness

toConstr :: SrcUnpackedness -> Constr

dataTypeOf :: SrcUnpackedness -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcUnpackedness)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcUnpackedness)

gmapT :: (forall b. Data b => b -> b) -> SrcUnpackedness -> SrcUnpackedness

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcUnpackedness -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcUnpackedness -> r

gmapQ :: (forall d. Data d => d -> u) -> SrcUnpackedness -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcUnpackedness -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness

Binary SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

put_ :: BinHandle -> SrcUnpackedness -> IO ()

put :: BinHandle -> SrcUnpackedness -> IO (Bin SrcUnpackedness)

get :: BinHandle -> IO SrcUnpackedness

Outputable SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcUnpackedness -> SDoc

Eq SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

(==) :: SrcUnpackedness -> SrcUnpackedness -> Bool

(/=) :: SrcUnpackedness -> SrcUnpackedness -> Bool

data SrcStrictness

Source Strictness

What strictness annotation the user wrote

Constructors

SrcLazy

Lazy, ie ~

SrcStrict

Strict, ie !

NoSrcStrict

no strictness annotation

Instances

Data SrcStrictness

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcStrictness -> c SrcStrictness

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcStrictness

toConstr :: SrcStrictness -> Constr

dataTypeOf :: SrcStrictness -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcStrictness)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcStrictness)

gmapT :: (forall b. Data b => b -> b) -> SrcStrictness -> SrcStrictness

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcStrictness -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcStrictness -> r

gmapQ :: (forall d. Data d => d -> u) -> SrcStrictness -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcStrictness -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness

Binary SrcStrictness

Defined in GHC.Core.DataCon

Methods

put_ :: BinHandle -> SrcStrictness -> IO ()

put :: BinHandle -> SrcStrictness -> IO (Bin SrcStrictness)

get :: BinHandle -> IO SrcStrictness

Outputable SrcStrictness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcStrictness -> SDoc

Eq SrcStrictness

Defined in GHC.Core.DataCon

Methods

(==) :: SrcStrictness -> SrcStrictness -> Bool

(/=) :: SrcStrictness -> SrcStrictness -> Bool

data HsSrcBang

Haskell Source Bang

Bangs on data constructor arguments as the user wrote them in the source code.

(HsSrcBang _ SrcUnpack SrcLazy) and (HsSrcBang _ SrcUnpack NoSrcStrict) (without StrictData) makes no sense, we emit a warning (in checkValidDataCon) and treat it like (HsSrcBang _ NoSrcUnpack SrcLazy)

Constructors

HsSrcBang SourceText SrcUnpackedness SrcStrictness

Instances

Data HsSrcBang

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsSrcBang -> c HsSrcBang

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsSrcBang

toConstr :: HsSrcBang -> Constr

dataTypeOf :: HsSrcBang -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsSrcBang)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsSrcBang)

gmapT :: (forall b. Data b => b -> b) -> HsSrcBang -> HsSrcBang

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsSrcBang -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsSrcBang -> r

gmapQ :: (forall d. Data d => d -> u) -> HsSrcBang -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsSrcBang -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang

Outputable HsSrcBang

Defined in GHC.Core.DataCon

Methods

ppr :: HsSrcBang -> SDoc

data HsImplBang

Haskell Implementation Bang

Bangs of data constructor arguments as generated by the compiler after consulting HsSrcBang, flags, etc.

Constructors

HsLazy

Lazy field, or one with an unlifted type

HsStrict

Strict but not unpacked field

HsUnpack (Maybe Coercion)

Strict and unpacked field co :: arg-ty ~ product-ty HsBang

Instances

Data HsImplBang

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsImplBang -> c HsImplBang

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsImplBang

toConstr :: HsImplBang -> Constr

dataTypeOf :: HsImplBang -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsImplBang)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsImplBang)

gmapT :: (forall b. Data b => b -> b) -> HsImplBang -> HsImplBang

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsImplBang -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsImplBang -> r

gmapQ :: (forall d. Data d => d -> u) -> HsImplBang -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsImplBang -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang

Outputable HsImplBang

Defined in GHC.Core.DataCon

Methods

ppr :: HsImplBang -> SDoc

substEqSpec :: TCvSubst -> EqSpec -> EqSpec

Substitute in an EqSpec. Precondition: if the LHS of the EqSpec is mapped in the substitution, it is mapped to a type variable, not a full type.

splitDataProductType_maybe

Arguments

:: Type

A product type, perhaps

-> Maybe (TyCon, [Type], DataCon, [Scaled Type])

Extract the type constructor, type argument, data constructor and it's representation argument types from a type if it is a product type.

Precisely, we return Just for any data type that is all of:

• Concrete (i.e. constructors visible)
• Single-constructor
• ... which has no existentials

Whether the type is a data type or a newtype.

specialPromotedDc :: DataCon -> Bool

Should this DataCon be allowed in a type even without -XDataKinds? Currently, only Lifted & Unlifted

mkEqSpec :: TyVar -> Type -> EqSpec

Make a non-dependent EqSpec

mkDataCon

Arguments

:: Name

-> Bool

Is the constructor declared infix?

-> TyConRepName

TyConRepName for the promoted TyCon

-> [HsSrcBang]

Strictness/unpack annotations, from user

-> [FieldLabel]

Field labels for the constructor, if it is a record, otherwise empty

-> [TyVar]

Universals.

-> [TyCoVar]

Existentials.

-> [InvisTVBinder]

User-written TyVarBinders. These must be Inferred/Specified. See Note [TyVarBinders in DataCons]

-> [EqSpec]

GADT equalities

-> KnotTied ThetaType

Theta-type occurring before the arguments proper

-> [KnotTied (Scaled Type)]

Original argument types

-> KnotTied Type

Original result type

-> RuntimeRepInfo

See comments on RuntimeRepInfo

-> KnotTied TyCon

Representation type constructor

-> ConTag

Constructor tag

-> ThetaType

The "stupid theta", context of the data declaration e.g. data Eq a => T a ...

-> Id

Worker Id

-> DataConRep

Representation

-> DataCon

Build a new data constructor

isVanillaDataCon :: DataCon -> Bool

Vanilla DataCons are those that are nice boring Haskell 98 constructors

isUnboxedTupleDataCon :: DataCon -> Bool

isTupleDataCon :: DataCon -> Bool

isSrcUnpacked :: SrcUnpackedness -> Bool

isSrcStrict :: SrcStrictness -> Bool

isNullarySrcDataCon :: DataCon -> Bool

Return whether there are any argument types for this DataCons original source type See Note [DataCon arities]

isNullaryRepDataCon :: DataCon -> Bool

Return whether there are any argument types for this DataCons runtime representation type See Note [DataCon arities]

isNewDataCon :: DataCon -> Bool

Is this the DataCon of a newtype?

isMarkedStrict :: StrictnessMark -> Bool

isBoxedTupleDataCon :: DataCon -> Bool

isBanged :: HsImplBang -> Bool

filterEqSpec :: [EqSpec] -> [TyVar] -> [TyVar]

Filter out any TyVars mentioned in an EqSpec.

eqSpecType :: EqSpec -> Type

eqSpecTyVar :: EqSpec -> TyVar

eqSpecPreds :: [EqSpec] -> ThetaType

eqSpecPair :: EqSpec -> (TyVar, Type)

eqHsBang :: HsImplBang -> HsImplBang -> Bool

Compare strictness annotations

dataConWrapperType :: DataCon -> Type

The user-declared type of the data constructor in the nice-to-read form:

T :: forall a b. a -> b -> T [a]

rather than:

T :: forall a c. forall b. (c~[a]) => a -> b -> T c

The type variables are quantified in the order that the user wrote them. See Note [DataCon user type variable binders].

NB: If the constructor is part of a data instance, the result type mentions the family tycon, not the internal one.

dataConWrapId_maybe :: DataCon -> Maybe Id

Get the Id of the DataCon wrapper: a function that wraps the "actual" constructor so it has the type visible in the source program: c.f. dataConWorkId. Returns Nothing if there is no wrapper, which occurs for an algebraic data constructor and also for a newtype (whose constructor is inlined compulsorily)

dataConUserTyVarsArePermuted :: DataCon -> Bool

Were the type variables of the data con written in a different order than the regular order (universal tyvars followed by existential tyvars)?

This is not a cheap test, so we minimize its use in GHC as much as possible. Currently, its only call site in the GHC codebase is in mkDataConRep in MkId, and so dataConUserTyVarsArePermuted is only called at most once during a data constructor's lifetime.

dataConUnivTyVars :: DataCon -> [TyVar]

The universally-quantified type variables of the constructor

dataConUnivAndExTyCoVars :: DataCon -> [TyCoVar]

Both the universal and existential type/coercion variables of the constructor

dataConTheta :: DataCon -> ThetaType

The *full* constraints on the constructor type, including dependent GADT equalities.

dataConTagZ :: DataCon -> ConTagZ

dataConTag :: DataCon -> ConTag

The tag used for ordering DataCons

dataConSrcBangs :: DataCon -> [HsSrcBang]

Strictness/unpack annotations, from user; or, for imported DataCons, from the interface file The list is in one-to-one correspondence with the arity of the DataCon

dataConRepType :: DataCon -> Type

The representation type of the data constructor, i.e. the sort type that will represent values of this type at runtime

dataConRepStrictness :: DataCon -> [StrictnessMark]

Give the demands on the arguments of a Core constructor application (Con dc args)

dataConRepArity :: DataCon -> Arity

Gives the number of actual fields in the representation of the data constructor. This may be more than appear in the source code; the extra ones are the existentially quantified dictionaries

dataConRepArgTys :: DataCon -> [Scaled Type]

Returns the arg types of the worker, including *all* non-dependent evidence, after any flattening has been done and without substituting for any type variables

dataConOtherTheta :: DataCon -> ThetaType

Returns constraints in the wrapper type, other than those in the dataConEqSpec

dataConOrigTyCon :: DataCon -> TyCon

The original type constructor used in the definition of this data constructor. In case of a data family instance, that will be the family type constructor.

dataConOrigResTy :: DataCon -> Type

dataConOrigArgTys :: DataCon -> [Scaled Type]

Returns the argument types of the wrapper, excluding all dictionary arguments and without substituting for any type variables

dataConNonlinearType :: DataCon -> Type

dataConIsInfix :: DataCon -> Bool

Should the DataCon be presented infix?

dataConInstSig :: DataCon -> [Type] -> ([TyCoVar], ThetaType, [Type])

Instantiate the universal tyvars of a data con, returning ( instantiated existentials , instantiated constraints including dependent GADT equalities which are *also* listed in the instantiated existentials , instantiated args)

dataConInstArgTys

Arguments

:: DataCon

A datacon with no existentials or equality constraints However, it can have a dcTheta (notably it can be a class dictionary, with superclasses)

-> [Type]

Instantiated at these types

-> [Scaled Type]

Finds the instantiated types of the arguments required to construct a DataCon representation NB: these INCLUDE any dictionary args but EXCLUDE the data-declaration context, which is discarded It's all post-flattening etc; this is a representation type

dataConImplicitTyThings :: DataCon -> [TyThing]

Find all the Ids implicitly brought into scope by the data constructor. Currently, the union of the dataConWorkId and the dataConWrapId

dataConImplBangs :: DataCon -> [HsImplBang]

dataConIdentity :: DataCon -> ByteString

The string package:module.name identifying a constructor, which is attached to its info table and used by the GHCi debugger and the heap profiler

dataConFieldType_maybe :: DataCon -> FieldLabelString -> Maybe (FieldLabel, Type)

Extract the label and type for any given labelled field of the DataCon, or return Nothing if the field does not belong to it

dataConFieldType :: DataCon -> FieldLabelString -> Type

Extract the type for any given labelled field of the DataCon

dataConEqSpec :: DataCon -> [EqSpec]

Equalities derived from the result type of the data constructor, as written by the programmer in any GADT declaration. This includes *all* GADT-like equalities, including those written in by hand by the programmer.

dataConDisplayType :: Bool -> DataCon -> Type

dataConCannotMatch :: [Type] -> DataCon -> Bool

dataConBoxer :: DataCon -> Maybe DataConBoxer

classDataCon :: Class -> DataCon

data EqSpec

An EqSpec is a tyvar/type pair representing an equality made in rejigging a GADT constructor

Instances

Outputable EqSpec

Defined in GHC.Core.DataCon

Methods

ppr :: EqSpec -> SDoc

data DataConRep

Data Constructor Representation See Note [Data constructor workers and wrappers]

Constructors

NoDataConRep

DCR

Fields

• dcr_wrap_id :: Id
• dcr_boxer :: DataConBoxer
• dcr_arg_tys :: [Scaled Type]
• dcr_stricts :: [StrictnessMark]
• dcr_bangs :: [HsImplBang]

data DataCon

A data constructor

• AnnKeywordId : AnnOpen, AnnClose,AnnComma

Instances

Data DataCon

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataCon -> c DataCon

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataCon

toConstr :: DataCon -> Constr

dataTypeOf :: DataCon -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DataCon)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DataCon)

gmapT :: (forall b. Data b => b -> b) -> DataCon -> DataCon

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataCon -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataCon -> r

gmapQ :: (forall d. Data d => d -> u) -> DataCon -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DataCon -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataCon -> m DataCon

NamedThing DataCon

Defined in GHC.Core.DataCon

Methods

getOccName :: DataCon -> OccName

getName :: DataCon -> Name

Uniquable DataCon

Defined in GHC.Core.DataCon

Methods

getUnique :: DataCon -> Unique

Outputable DataCon

Defined in GHC.Core.DataCon

Methods

ppr :: DataCon -> SDoc

OutputableBndr DataCon

Defined in GHC.Core.DataCon

Methods

pprBndr :: BindingSite -> DataCon -> SDoc

pprPrefixOcc :: DataCon -> SDoc

pprInfixOcc :: DataCon -> SDoc

bndrIsJoin_maybe :: DataCon -> Maybe Int

Eq DataCon

Defined in GHC.Core.DataCon

Methods

(==) :: DataCon -> DataCon -> Bool

(/=) :: DataCon -> DataCon -> Bool

promoteDataCon :: DataCon -> TyCon

isUnboxedSumDataCon :: DataCon -> Bool

dataConWrapId :: DataCon -> Id

Returns an Id which looks like the Haskell-source constructor by using the wrapper if it exists (see dataConWrapId_maybe) and failing over to the worker (see dataConWorkId)

dataConWorkId :: DataCon -> Id

Get the Id of the DataCon worker: a function that is the "actual" constructor and has no top level binding in the program. The type may be different from the obvious one written in the source program. Panics if there is no such Id for this DataCon

dataConUserTyVars :: DataCon -> [TyVar]

The type variables of the constructor, in the order the user wrote them

dataConUserTyVarBinders :: DataCon -> [InvisTVBinder]

InvisTVBinders for the type variables of the constructor, in the order the user wrote them

dataConTyCon :: DataCon -> TyCon

The type constructor that we are building via this data constructor

dataConStupidTheta :: DataCon -> ThetaType

The "stupid theta" of the DataCon, such as data Eq a in:

data Eq a => T a = ...

dataConSourceArity :: DataCon -> Arity

Source-level arity of the data constructor

dataConName :: DataCon -> Name

The Name of the DataCon, giving it a unique, rooted identification

dataConInstOrigArgTys :: DataCon -> [Type] -> [Scaled Type]

Returns just the instantiated value argument types of a DataCon, (excluding dictionary args)

dataConFullSig :: DataCon -> ([TyVar], [TyCoVar], [EqSpec], ThetaType, [Scaled Type], Type)

The "full signature" of the DataCon returns, in order:

1) The result of dataConUnivTyVars

2) The result of dataConExTyCoVars

3) The non-dependent GADT equalities. Dependent GADT equalities are implied by coercion variables in return value (2).

4) The other constraints of the data constructor type, excluding GADT equalities

5) The original argument types to the DataCon (i.e. before any change of the representation of the type) with linearity annotations

6) The original result type of the DataCon

dataConFieldLabels :: DataCon -> [FieldLabel]

The labels for the fields of this particular DataCon

type ConTag = Int

A *one-index* constructor tag

Type of the tags associated with each constructor possibility or superclass selector

fIRST_TAG :: ConTag

Tags are allocated from here for real constructors or for superclass selectors

type FieldLabelString = FastString

Field labels are just represented as strings; they are not necessarily unique (even within a module)

data FieldLabel

Fields in an algebraic record type; see Note [FieldLabel].

Constructors

FieldLabel

Fields

• flLabel :: FieldLabelString

  User-visible label of the field

• flHasDuplicateRecordFields :: DuplicateRecordFields

  Was DuplicateRecordFields on in the defining module for this datatype?

• flHasFieldSelector :: FieldSelectors

  Was FieldSelectors enabled in the defining module for this datatype? See Note [NoFieldSelectors] in GHC.Rename.Env

• flSelector :: Name

  Record selector function

Instances

Data FieldLabel

Defined in GHC.Types.FieldLabel

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> FieldLabel -> c FieldLabel

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c FieldLabel

toConstr :: FieldLabel -> Constr

dataTypeOf :: FieldLabel -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c FieldLabel)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c FieldLabel)

gmapT :: (forall b. Data b => b -> b) -> FieldLabel -> FieldLabel

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> FieldLabel -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> FieldLabel -> r

gmapQ :: (forall d. Data d => d -> u) -> FieldLabel -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> FieldLabel -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> FieldLabel -> m FieldLabel

HasOccName FieldLabel

Defined in GHC.Types.FieldLabel

Methods

occName :: FieldLabel -> OccName

Binary Name => Binary FieldLabel

We need the Binary Name constraint here even though there is an instance defined in GHC.Types.Name, because the we have a SOURCE import, so the instance is not in scope. And the instance cannot be added to Name.hs-boot because GHC.Utils.Binary itself depends on GHC.Types.Name.

Defined in GHC.Types.FieldLabel

Methods

put_ :: BinHandle -> FieldLabel -> IO ()

put :: BinHandle -> FieldLabel -> IO (Bin FieldLabel)

get :: BinHandle -> IO FieldLabel

Outputable FieldLabel

Defined in GHC.Types.FieldLabel

Methods

ppr :: FieldLabel -> SDoc

Eq FieldLabel

Defined in GHC.Types.FieldLabel

Methods

(==) :: FieldLabel -> FieldLabel -> Bool

(/=) :: FieldLabel -> FieldLabel -> Bool

ToHie (IEContext (Located FieldLabel))

Defined in Compat.HieAst

Methods

toHie :: IEContext (Located FieldLabel) -> HieM [HieAST Type]

data InjectivityCheckResult

Result of testing two type family equations for injectiviy.

Constructors

InjectivityAccepted

Either RHSs are distinct or unification of RHSs leads to unification of LHSs

InjectivityUnified CoAxBranch CoAxBranch

RHSs unify but LHSs don't unify under that substitution. Relevant for closed type families where equation after unification might be overlpapped (in which case it is OK if they don't unify). Constructor stores axioms after unification.

data FamInstMatch

Constructors

FamInstMatch

Fields

• fim_instance :: FamInst
• fim_tys :: [Type]
• fim_cos :: [Coercion]

Instances

Outputable FamInstMatch

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamInstMatch -> SDoc

type FamInstEnvs = (FamInstEnv, FamInstEnv)

type FamInstEnv = UniqDFM TyCon FamilyInstEnv

data FamInst

Constructors

FamInst

Fields

• fi_axiom :: CoAxiom Unbranched
• fi_flavor :: FamFlavor
• fi_fam :: Name
• fi_tcs :: [RoughMatchTc]
• fi_tvs :: [TyVar]
• fi_cvs :: [CoVar]
• fi_tys :: [Type]
• fi_rhs :: Type

Instances

NamedThing FamInst

Defined in GHC.Core.FamInstEnv

Methods

getOccName :: FamInst -> OccName

getName :: FamInst -> Name

Outputable FamInst

Defined in GHC.Core.FamInstEnv

Methods

ppr :: FamInst -> SDoc

data FamFlavor

Constructors

SynFamilyInst

DataFamilyInst TyCon

topReduceTyFamApp_maybe :: FamInstEnvs -> TyCon -> [Type] -> Maybe (Coercion, Type, MCoercion)

Try to simplify a type-family application, by *one* step If topReduceTyFamApp_maybe env r F tys = Just (co, rhs, res_co) then co :: F tys ~R# rhs res_co :: typeKind(F tys) ~ typeKind(rhs) Type families and data families; always Representational role

topNormaliseType_maybe :: FamInstEnvs -> Type -> Maybe (Coercion, Type)

Get rid of *outermost* (or toplevel) * type function redex * data family redex * newtypes returning an appropriate Representational coercion. Specifically, if topNormaliseType_maybe env ty = Just (co, ty') then (a) co :: ty ~R ty' (b) ty' is not a newtype, and is not a type-family or data-family redex

However, ty' can be something like (Maybe (F ty)), where (F ty) is a redex.

Always operates homogeneously: the returned type has the same kind as the original type, and the returned coercion is always homogeneous.

topNormaliseType :: FamInstEnvs -> Type -> Type

reduceTyFamApp_maybe :: FamInstEnvs -> Role -> TyCon -> [Type] -> Maybe (Coercion, Type)

pprFamInsts :: [FamInst] -> SDoc

normaliseType :: FamInstEnvs -> Role -> Type -> (Coercion, Type)

normaliseTcApp :: FamInstEnvs -> Role -> TyCon -> [Type] -> (Coercion, Type)

mkUnbranchedCoAxiom :: Name -> TyCon -> CoAxBranch -> CoAxiom Unbranched

mkSingleCoAxiom :: Role -> Name -> [TyVar] -> [TyVar] -> [CoVar] -> TyCon -> [Type] -> Type -> CoAxiom Unbranched

mkNewTypeCoAxiom :: Name -> TyCon -> [TyVar] -> [Role] -> Type -> CoAxiom Unbranched

Create a coercion constructor (axiom) suitable for the given newtype TyCon. The Name should be that of a new coercion CoAxiom, the TyVars the arguments expected by the newtype and the type the appropriate right hand side of the newtype, with the free variables a subset of those TyVars.

mkImportedFamInst :: Name -> [RoughMatchTc] -> CoAxiom Unbranched -> FamInst

mkCoAxBranch :: [TyVar] -> [TyVar] -> [CoVar] -> [Type] -> Type -> [Role] -> SrcSpan -> CoAxBranch

mkBranchedCoAxiom :: Name -> TyCon -> [CoAxBranch] -> CoAxiom Branched

lookupFamInstEnvInjectivityConflicts :: [Bool] -> FamInstEnvs -> FamInst -> [CoAxBranch]

Check whether an open type family equation can be added to already existing instance environment without causing conflicts with supplied injectivity annotations. Returns list of conflicting axioms (type instance declarations).

lookupFamInstEnvConflicts :: FamInstEnvs -> FamInst -> [FamInstMatch]

lookupFamInstEnvByTyCon :: FamInstEnvs -> TyCon -> [FamInst]

lookupFamInstEnv :: FamInstEnvs -> TyCon -> [Type] -> [FamInstMatch]

isDominatedBy :: CoAxBranch -> [CoAxBranch] -> Bool

injectiveBranches :: [Bool] -> CoAxBranch -> CoAxBranch -> InjectivityCheckResult

Check whether two type family axioms don't violate injectivity annotation.

familyInstances :: (FamInstEnv, FamInstEnv) -> TyCon -> [FamInst]

famInstsRepTyCons :: [FamInst] -> [TyCon]

famInstTyCon :: FamInst -> TyCon

famInstRepTyCon_maybe :: FamInst -> Maybe TyCon

famInstRHS :: FamInst -> Type

famInstEnvSize :: FamInstEnv -> Int

famInstEnvElts :: FamInstEnv -> [FamInst]

famInstAxiom :: FamInst -> CoAxiom Unbranched

extendFamInstEnvList :: FamInstEnv -> [FamInst] -> FamInstEnv

extendFamInstEnv :: FamInstEnv -> FamInst -> FamInstEnv

emptyFamInstEnvs :: (FamInstEnv, FamInstEnv)

emptyFamInstEnv :: FamInstEnv

dataFamInstRepTyCon :: FamInst -> TyCon

apartnessCheck

Arguments

:: [Type]

flattened target arguments. Make sure they're flattened! See Note [Flattening type-family applications when matching instances] in GHC.Core.Unify.

-> CoAxBranch

the candidate equation we wish to use Precondition: this matches the target

-> Bool

True = equation can fire

Do an apartness check, as described in the "Closed Type Families" paper (POPL '14). This should be used when determining if an equation (CoAxBranch) of a closed type family can be used to reduce a certain target type family application.

module GHC.Core.InstEnv

newtype NonDetUniqFM key ele

A wrapper around UniqFM with the sole purpose of informing call sites that the provided Foldable and Traversable instances are nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.

Constructors

NonDetUniqFM

Fields

• getNonDet :: UniqFM key ele

Instances

Foldable (NonDetUniqFM key)

Inherently nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.

Defined in GHC.Types.Unique.FM

Methods

fold :: Monoid m => NonDetUniqFM key m -> m

foldMap :: Monoid m => (a -> m) -> NonDetUniqFM key a -> m

foldMap' :: Monoid m => (a -> m) -> NonDetUniqFM key a -> m

foldr :: (a -> b -> b) -> b -> NonDetUniqFM key a -> b

foldr' :: (a -> b -> b) -> b -> NonDetUniqFM key a -> b

foldl :: (b -> a -> b) -> b -> NonDetUniqFM key a -> b

foldl' :: (b -> a -> b) -> b -> NonDetUniqFM key a -> b

foldr1 :: (a -> a -> a) -> NonDetUniqFM key a -> a

foldl1 :: (a -> a -> a) -> NonDetUniqFM key a -> a

toList :: NonDetUniqFM key a -> [a]

null :: NonDetUniqFM key a -> Bool

length :: NonDetUniqFM key a -> Int

elem :: Eq a => a -> NonDetUniqFM key a -> Bool

maximum :: Ord a => NonDetUniqFM key a -> a

minimum :: Ord a => NonDetUniqFM key a -> a

sum :: Num a => NonDetUniqFM key a -> a

product :: Num a => NonDetUniqFM key a -> a

Traversable (NonDetUniqFM key)

Inherently nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.

Defined in GHC.Types.Unique.FM

Methods

traverse :: Applicative f => (a -> f b) -> NonDetUniqFM key a -> f (NonDetUniqFM key b)

sequenceA :: Applicative f => NonDetUniqFM key (f a) -> f (NonDetUniqFM key a)

mapM :: Monad m => (a -> m b) -> NonDetUniqFM key a -> m (NonDetUniqFM key b)

sequence :: Monad m => NonDetUniqFM key (m a) -> m (NonDetUniqFM key a)

Functor (NonDetUniqFM key)

Defined in GHC.Types.Unique.FM

Methods

fmap :: (a -> b) -> NonDetUniqFM key a -> NonDetUniqFM key b

(<$) :: a -> NonDetUniqFM key b -> NonDetUniqFM key a

zipToUFM :: Uniquable key => [key] -> [elt] -> UniqFM key elt

unsafeIntMapToUFM :: IntMap elt -> UniqFM key elt

unsafeCastUFMKey :: UniqFM key1 elt -> UniqFM key2 elt

Cast the key domain of a UniqFM.

As long as the domains don't overlap in their uniques this is safe.

unitUFM :: Uniquable key => key -> elt -> UniqFM key elt

unitDirectlyUFM :: Unique -> elt -> UniqFM key elt

ufmToSet_Directly :: UniqFM key elt -> IntSet

ufmToIntMap :: UniqFM key elt -> IntMap elt

sizeUFM :: UniqFM key elt -> Int

seqEltsUFM :: ([elt] -> ()) -> UniqFM key elt -> ()

pprUniqFM :: (a -> SDoc) -> UniqFM key a -> SDoc

pprUFMWithKeys

Arguments

:: UniqFM key a

The things to be pretty printed

-> ([(Unique, a)] -> SDoc)

The pretty printing function to use on the elements

-> SDoc

SDoc where the things have been pretty printed

Pretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetUFMToList.

pprUFM

Arguments

:: UniqFM key a

The things to be pretty printed

-> ([a] -> SDoc)

The pretty printing function to use on the elements

-> SDoc

SDoc where the things have been pretty printed

Pretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetEltsUFM.

plusUFM_CD2 :: (Maybe elta -> Maybe eltb -> eltc) -> UniqFM key elta -> UniqFM key eltb -> UniqFM key eltc

`plusUFM_CD2 f m1 m2` merges the maps using f as the combining function. Unlike plusUFM_CD, a missing value is not defaulted: it is instead passed as Nothing to f. f can never have both its arguments be Nothing.

IMPORTANT NOTE: This function strictly applies the modification function and forces the result.

`plusUFM_CD2 f m1 m2` is the same as `plusUFM_CD f (mapUFM Just m1) Nothing (mapUFM Just m2) Nothing`.

plusUFM_CD :: (elta -> eltb -> eltc) -> UniqFM key elta -> elta -> UniqFM key eltb -> eltb -> UniqFM key eltc

`plusUFM_CD f m1 d1 m2 d2` merges the maps using f as the combinding function and d1 resp. d2 as the default value if there is no entry in m1 reps. m2. The domain is the union of the domains of m1 and m2.

IMPORTANT NOTE: This function strictly applies the modification function and forces the result unlike most the other functions in this module.

Representative example:

plusUFM_CD f {A: 1, B: 2} 23 {B: 3, C: 4} 42
   == {A: f 1 42, B: f 2 3, C: f 23 4 }

plusUFM_C :: (elt -> elt -> elt) -> UniqFM key elt -> UniqFM key elt -> UniqFM key elt

plusUFMList :: [UniqFM key elt] -> UniqFM key elt

plusUFM :: UniqFM key elt -> UniqFM key elt -> UniqFM key elt

plusMaybeUFM_C :: (elt -> elt -> Maybe elt) -> UniqFM key elt -> UniqFM key elt -> UniqFM key elt

pluralUFM :: UniqFM key a -> SDoc

Determines the pluralisation suffix appropriate for the length of a set in the same way that plural from Outputable does for lists.

partitionUFM :: (elt -> Bool) -> UniqFM key elt -> (UniqFM key elt, UniqFM key elt)

nonDetUFMToList :: UniqFM key elt -> [(Unique, elt)]

nonDetStrictFoldUFM_Directly :: (Unique -> elt -> a -> a) -> a -> UniqFM key elt -> a

nonDetStrictFoldUFM :: (elt -> a -> a) -> a -> UniqFM key elt -> a

nonDetKeysUFM :: UniqFM key elt -> [Unique]

nonDetEltsUFM :: UniqFM key elt -> [elt]

minusUFM :: UniqFM key elt1 -> UniqFM key elt2 -> UniqFM key elt1

mergeUFM :: (elta -> eltb -> Maybe eltc) -> (UniqFM key elta -> UniqFM key eltc) -> (UniqFM key eltb -> UniqFM key eltc) -> UniqFM key elta -> UniqFM key eltb -> UniqFM key eltc

mapUFM_Directly :: (Unique -> elt1 -> elt2) -> UniqFM key elt1 -> UniqFM key elt2

mapUFM :: (elt1 -> elt2) -> UniqFM key elt1 -> UniqFM key elt2

mapMaybeUFM :: (elt1 -> Maybe elt2) -> UniqFM key elt1 -> UniqFM key elt2

lookupWithDefaultUFM_Directly :: UniqFM key elt -> elt -> Unique -> elt

lookupWithDefaultUFM :: Uniquable key => UniqFM key elt -> elt -> key -> elt

lookupUFM_Directly :: UniqFM key elt -> Unique -> Maybe elt

lookupUFM :: Uniquable key => UniqFM key elt -> key -> Maybe elt

listToUFM_Directly :: [(Unique, elt)] -> UniqFM key elt

listToUFM_C :: Uniquable key => (elt -> elt -> elt) -> [(key, elt)] -> UniqFM key elt

listToUFM :: Uniquable key => [(key, elt)] -> UniqFM key elt

listToIdentityUFM :: Uniquable key => [key] -> UniqFM key key

isNullUFM :: UniqFM key elt -> Bool

intersectUFM_C :: (elt1 -> elt2 -> elt3) -> UniqFM key elt1 -> UniqFM key elt2 -> UniqFM key elt3

intersectUFM :: UniqFM key elt1 -> UniqFM key elt2 -> UniqFM key elt1

foldUFM :: (elt -> a -> a) -> a -> UniqFM key elt -> a

filterUFM_Directly :: (Unique -> elt -> Bool) -> UniqFM key elt -> UniqFM key elt

filterUFM :: (elt -> Bool) -> UniqFM key elt -> UniqFM key elt

equalKeysUFM :: UniqFM key a -> UniqFM key b -> Bool

emptyUFM :: UniqFM key elt

eltsUFM :: UniqFM key elt -> [elt]

elemUFM_Directly :: Unique -> UniqFM key elt -> Bool

elemUFM :: Uniquable key => key -> UniqFM key elt -> Bool

disjointUFM :: UniqFM key elt1 -> UniqFM key elt2 -> Bool

delListFromUFM_Directly :: UniqFM key elt -> [Unique] -> UniqFM key elt

delListFromUFM :: Uniquable key => UniqFM key elt -> [key] -> UniqFM key elt

delFromUFM_Directly :: UniqFM key elt -> Unique -> UniqFM key elt

delFromUFM :: Uniquable key => UniqFM key elt -> key -> UniqFM key elt

anyUFM :: (elt -> Bool) -> UniqFM key elt -> Bool

alterUFM :: Uniquable key => (Maybe elt -> Maybe elt) -> UniqFM key elt -> key -> UniqFM key elt

allUFM :: (elt -> Bool) -> UniqFM key elt -> Bool

adjustUFM_Directly :: (elt -> elt) -> UniqFM key elt -> Unique -> UniqFM key elt

adjustUFM :: Uniquable key => (elt -> elt) -> UniqFM key elt -> key -> UniqFM key elt

addToUFM_Directly :: UniqFM key elt -> Unique -> elt -> UniqFM key elt

addToUFM_C :: Uniquable key => (elt -> elt -> elt) -> UniqFM key elt -> key -> elt -> UniqFM key elt

addToUFM_Acc :: Uniquable key => (elt -> elts -> elts) -> (elt -> elts) -> UniqFM key elts -> key -> elt -> UniqFM key elts

addToUFM :: Uniquable key => UniqFM key elt -> key -> elt -> UniqFM key elt

addListToUFM_Directly :: UniqFM key elt -> [(Unique, elt)] -> UniqFM key elt

addListToUFM_C :: Uniquable key => (elt -> elt -> elt) -> UniqFM key elt -> [(key, elt)] -> UniqFM key elt

Add elements to the map, combining existing values with inserted ones using the given function.

addListToUFM :: Uniquable key => UniqFM key elt -> [(key, elt)] -> UniqFM key elt

module GHC.Core.PatSyn

module GHC.Core.Predicate

module GHC.Core.TyCon

module GHC.Core.TyCo.Ppr

data TyCoMapper env (m :: Type -> Type)

This describes how a "map" operation over a type/coercion should behave

Constructors

TyCoMapper

Fields

• tcm_tyvar :: env -> TyVar -> m Type
• tcm_covar :: env -> CoVar -> m Coercion
• tcm_hole :: env -> CoercionHole -> m Coercion

  What to do with coercion holes. See Note [Coercion holes] in GHC.Core.TyCo.Rep.

• tcm_tycobinder :: env -> TyCoVar -> ArgFlag -> m (env, TyCoVar)

  The returned env is used in the extended scope

• tcm_tycon :: TyCon -> m TyCon

  This is used only for TcTyCons a) To zonk TcTyCons b) To turn TcTyCons into TyCons. See Note [Type checking recursive type and class declarations] in GHC.Tc.TyCl

userTypeError_maybe :: Type -> Maybe Type

Is this type a custom user error? If so, give us the kind and the error message.

unrestricted :: a -> Scaled a

Scale a payload by Many

typeKind :: HasDebugCallStack => Type -> Kind

tymult :: a -> Scaled a

Scale a payload by Many; used for type arguments in core

tyConsOfType :: Type -> UniqSet TyCon

All type constructors occurring in the type; looking through type synonyms, but not newtypes. When it finds a Class, it returns the class TyCon.

tyConBindersTyCoBinders :: [TyConBinder] -> [TyCoBinder]

tyConArgFlags :: TyCon -> [Type] -> [ArgFlag]

Given a TyCon and a list of argument types to which the TyCon is applied, determine each argument's visibility (Inferred, Specified, or Required).

Wrinkle: consider the following scenario:

T :: forall k. k -> k
tyConArgFlags T [forall m. m -> m -> m, S, R, Q]

After substituting, we get

T (forall m. m -> m -> m) :: (forall m. m -> m -> m) -> forall n. n -> n -> n

Thus, the first argument is invisible, S is visible, R is invisible again, and Q is visible.

tyConAppTyConPicky_maybe :: Type -> Maybe TyCon

Retrieve the tycon heading this type, if there is one. Does not look through synonyms.

tyConAppTyCon :: Type -> TyCon

tyConAppNeedsKindSig

Arguments

:: Bool

Should specified binders count towards injective positions in the kind of the TyCon? (If you're using visible kind applications, then you want True here.

-> TyCon

-> Int

The number of args the TyCon is applied to.

-> Bool

Does T t_1 ... t_n need a kind signature? (Where n is the number of arguments)

Does a TyCon (that is applied to some number of arguments) need to be ascribed with an explicit kind signature to resolve ambiguity if rendered as a source-syntax type? (See Note [When does a tycon application need an explicit kind signature?] for a full explanation of what this function checks for.)

tyConAppArgs_maybe :: Type -> Maybe [Type]

The same as snd . splitTyConApp

tyConAppArgs :: Type -> [Type]

tyConAppArgN :: Int -> Type -> Type

tyCoBinderVar_maybe :: TyCoBinder -> Maybe TyCoVar

tyCoBinderType :: TyCoBinder -> Type

tyBinderType :: TyBinder -> Type

tcTypeKind :: HasDebugCallStack => Type -> Kind

tcSplitTyConApp_maybe :: HasCallStack => Type -> Maybe (TyCon, [Type])

Split a type constructor application into its type constructor and applied types. Note that this may fail in the case of a FunTy with an argument of unknown kind FunTy (e.g. FunTy (a :: k) Int. since the kind of a isn't of the form TYPE rep). Consequently, you may need to zonk your type before using this function.

This does *not* split types headed with (=>), as that's not a TyCon in the type-checker.

If you only need the TyCon, consider using tcTyConAppTyCon_maybe.

tcReturnsConstraintKind :: Kind -> Bool

tcRepSplitTyConApp_maybe :: HasDebugCallStack => Type -> Maybe (TyCon, [Type])

Like tcSplitTyConApp_maybe, but doesn't look through synonyms. This assumes the synonyms have already been dealt with.

Moreover, for a FunTy, it only succeeds if the argument types have enough info to extract the runtime-rep arguments that the funTyCon requires. This will usually be true; but may be temporarily false during canonicalization: see Note [Decomposing FunTy] in GHC.Tc.Solver.Canonical and Note [The Purely Kinded Type Invariant (PKTI)] in GHC.Tc.Gen.HsType, Wrinkle around FunTy

tcRepSplitAppTy_maybe :: Type -> Maybe (Type, Type)

Does the AppTy split as in tcSplitAppTy_maybe, but assumes that any coreView stuff is already done. Refuses to look through (c => t)

tcIsRuntimeTypeKind :: Kind -> Bool

Is this kind equivalent to TYPE r (for some unknown r)?

This considers Constraint to be distinct from *.

tcIsLiftedTypeKind :: Kind -> Bool

Is this kind equivalent to Type?

This considers Constraint to be distinct from Type. For a version that treats them as the same type, see isLiftedTypeKind.

tcIsConstraintKind :: Kind -> Bool

tcIsBoxedTypeKind :: Kind -> Bool

Is this kind equivalent to TYPE (BoxedRep l) for some l :: Levity?

This considers Constraint to be distinct from Type. For a version that treats them as the same type, see isLiftedTypeKind.

stripCoercionTy :: Type -> Coercion

splitVisVarsOfTypes :: [Type] -> Pair TyCoVarSet

splitVisVarsOfType :: Type -> Pair TyCoVarSet

Retrieve the free variables in this type, splitting them based on whether they are used visibly or invisibly. Invisible ones come first.

splitTyConApp :: Type -> (TyCon, [Type])

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor. Panics if that is not possible. See also splitTyConApp_maybe

splitPiTys :: Type -> ([TyCoBinder], Type)

Split off all TyCoBinders to a type, splitting both proper foralls and functions

splitPiTy_maybe :: Type -> Maybe (TyCoBinder, Type)

Attempts to take a forall type apart; works with proper foralls and functions

splitPiTy :: Type -> (TyCoBinder, Type)

Takes a forall type apart, or panics

splitListTyConApp_maybe :: Type -> Maybe Type

Attempts to tease a list type apart and gives the type of the elements if successful (looks through type synonyms)

splitInvisPiTysN :: Int -> Type -> ([TyCoBinder], Type)

Same as splitInvisPiTys, but stop when - you have found n TyCoBinders, - or you run out of invisible binders

splitInvisPiTys :: Type -> ([TyCoBinder], Type)

Like splitPiTys, but returns only *invisible* binders, including constraints. Stops at the first visible binder.

splitFunTys :: Type -> ([Scaled Type], Type)

splitFunTy_maybe :: Type -> Maybe (Mult, Type, Type)

Attempts to extract the multiplicity, argument and result types from a type

splitFunTy :: Type -> (Mult, Type, Type)

Attempts to extract the multiplicity, argument and result types from a type, and panics if that is not possible. See also splitFunTy_maybe

splitForAllTyVar_maybe :: Type -> Maybe (TyCoVar, Type)

Like splitForAllTyCoVar_maybe, but only returns Just if it is a tyvar binder.

splitForAllTyCoVars :: Type -> ([TyCoVar], Type)

Take a ForAllTy apart, returning the list of tycovars and the result type. This always succeeds, even if it returns only an empty list. Note that the result type returned may have free variables that were bound by a forall.

splitForAllTyCoVar_maybe :: Type -> Maybe (TyCoVar, Type)

Attempts to take a forall type apart, but only if it's a proper forall, with a named binder

splitForAllTyCoVarBinders :: Type -> ([TyCoVarBinder], Type)

Like splitPiTys but split off only named binders and returns TyCoVarBinders rather than TyCoBinders

splitForAllTyCoVar :: Type -> (TyCoVar, Type)

Take a forall type apart, or panics if that is not possible.

splitForAllReqTVBinders :: Type -> ([ReqTVBinder], Type)

Like splitForAllTyCoVars, but only splits ForAllTys with Required type variable binders. Furthermore, each returned tyvar is annotated with ().

splitForAllInvisTVBinders :: Type -> ([InvisTVBinder], Type)

Like splitForAllTyCoVars, but only splits ForAllTys with Invisible type variable binders. Furthermore, each returned tyvar is annotated with its Specificity.

splitForAllCoVar_maybe :: Type -> Maybe (TyCoVar, Type)

Like splitForAllTyCoVar_maybe, but only returns Just if it is a covar binder.

splitCastTy_maybe :: Type -> Maybe (Type, Coercion)

splitAppTys :: Type -> (Type, [Type])

Recursively splits a type as far as is possible, leaving a residual type being applied to and the type arguments applied to it. Never fails, even if that means returning an empty list of type applications.

splitAppTy_maybe :: Type -> Maybe (Type, Type)

Attempt to take a type application apart, whether it is a function, type constructor, or plain type application. Note that type family applications are NEVER unsaturated by this!

splitAppTy :: Type -> (Type, Type)

Attempts to take a type application apart, as in splitAppTy_maybe, and panics if this is not possible

seqTypes :: [Type] -> ()

seqType :: Type -> ()

scaledSet :: Scaled a -> b -> Scaled b

resultIsLevPoly :: Type -> Bool

Looking past all pi-types, is the end result potentially levity polymorphic? Example: True for (forall r (a :: TYPE r). String -> a) Example: False for (forall r1 r2 (a :: TYPE r1) (b :: TYPE r2). a -> b -> Type)

repSplitTyConApp_maybe :: HasDebugCallStack => Type -> Maybe (TyCon, [Type])

Like splitTyConApp_maybe, but doesn't look through synonyms. This assumes the synonyms have already been dealt with.

repSplitAppTys :: HasDebugCallStack => Type -> (Type, [Type])

Like splitAppTys, but doesn't look through type synonyms

repSplitAppTy_maybe :: HasDebugCallStack => Type -> Maybe (Type, Type)

Does the AppTy split as in splitAppTy_maybe, but assumes that any Core view stuff is already done

repGetTyVar_maybe :: Type -> Maybe TyVar

Attempts to obtain the type variable underlying a Type, without any expansion

pprUserTypeErrorTy :: Type -> SDoc

Render a type corresponding to a user type error into a SDoc.

pickyIsLiftedTypeKind :: Kind -> Bool

piResultTys :: HasDebugCallStack => Type -> [Type] -> Type

(piResultTys f_ty [ty1, .., tyn]) gives the type of (f ty1 .. tyn) where f :: f_ty piResultTys is interesting because: 1. f_ty may have more for-alls than there are args 2. Less obviously, it may have fewer for-alls For case 2. think of: piResultTys (forall a.a) [forall b.b, Int] This really can happen, but only (I think) in situations involving undefined. For example: undefined :: forall a. a Term: undefined (forall b. b->b) Int This term should have type (Int -> Int), but notice that there are more type args than foralls in undefineds type.

partitionInvisibles :: [(a, ArgFlag)] -> ([a], [a])

Given a list of things paired with their visibilities, partition the things into (invisible things, visible things).

occCheckExpand :: [Var] -> Type -> Maybe Type

nonDetCmpTypesX :: RnEnv2 -> [Type] -> [Type] -> Ordering

nonDetCmpTypes :: [Type] -> [Type] -> Ordering

nonDetCmpTypeX :: RnEnv2 -> Type -> Type -> Ordering

nonDetCmpType :: Type -> Type -> Ordering

nonDetCmpTc :: TyCon -> TyCon -> Ordering

Compare two TyCons. NB: This should never see Constraint (as recognized by Kind.isConstraintKindCon) which is considered a synonym for Type in Core. See Note [Kind Constraint and kind Type] in GHC.Core.Type. See Note [nonDetCmpType nondeterminism]

newTyConInstRhs :: TyCon -> [Type] -> Type

Unwrap one layer of newtype on a type constructor and its arguments, using an eta-reduced version of the newtype if possible. This requires tys to have at least newTyConInstArity tycon elements.

mkVisForAllTys :: [TyVar] -> Type -> Type

Like mkForAllTys, but assumes all variables are dependent and visible

mkTyConBindersPreferAnon

Arguments

:: [TyVar]

binders

-> TyCoVarSet

free variables of result

-> [TyConBinder]

Given a list of type-level vars and the free vars of a result kind, makes TyCoBinders, preferring anonymous binders if the variable is, in fact, not dependent. e.g. mkTyConBindersPreferAnon (k:*),(b:k),(c:k) We want (k:*) Named, (b:k) Anon, (c:k) Anon

All non-coercion binders are visible.

mkTyCoInvForAllTys :: [TyCoVar] -> Type -> Type

Like mkForAllTys, but assumes all variables are dependent and Inferred, a common case

mkTyCoInvForAllTy :: TyCoVar -> Type -> Type

Make a dependent forall over an Inferred variable

mkStrLitTy :: FastString -> Type

mkSpecForAllTys :: [TyVar] -> Type -> Type

Like mkForAllTys, but assumes all variables are dependent and Specified, a common case

mkSpecForAllTy :: TyVar -> Type -> Type

Like mkForAllTy, but assumes the variable is dependent and Specified, a common case

mkScaled :: Mult -> a -> Scaled a

mkNumLitTy :: Integer -> Type

mkInfForAllTy :: TyVar -> Type -> Type

Like mkTyCoInvForAllTy, but tv should be a tyvar

mkFamilyTyConApp :: TyCon -> [Type] -> Type

Given a family instance TyCon and its arg types, return the corresponding family type. E.g:

data family T a
data instance T (Maybe b) = MkT b

Where the instance tycon is :RTL, so:

mkFamilyTyConApp :RTL Int  =  T (Maybe Int)

mkCoercionTy :: Coercion -> Type

mkCharLitTy :: Char -> Type

mkAppTys :: Type -> [Type] -> Type

mkAnonBinder :: AnonArgFlag -> Scaled Type -> TyCoBinder

Make an anonymous binder

mightBeUnliftedType :: Type -> Bool

Returns:

• False if the type is guaranteed lifted or
• True if it is unlifted, OR we aren't sure (e.g. in a levity-polymorphic case)

mapTyCoX :: Monad m => TyCoMapper env m -> (env -> Type -> m Type, env -> [Type] -> m [Type], env -> Coercion -> m Coercion, env -> [Coercion] -> m [Coercion])

mapTyCo :: Monad m => TyCoMapper () m -> (Type -> m Type, [Type] -> m [Type], Coercion -> m Coercion, [Coercion] -> m [Coercion])

linear :: a -> Scaled a

Scale a payload by One

kindRep_maybe :: HasDebugCallStack => Kind -> Maybe Type

Given a kind (TYPE rr), extract its RuntimeRep classifier rr. For example, kindRep_maybe * = Just LiftedRep Returns Nothing if the kind is not of form (TYPE rr) Treats * and Constraint as the same

kindRep :: HasDebugCallStack => Kind -> Type

Extract the RuntimeRep classifier of a type from its kind. For example, kindRep * = LiftedRep; Panics if this is not possible. Treats * and Constraint as the same

isValidJoinPointType :: JoinArity -> Type -> Bool

Determine whether a type could be the type of a join point of given total arity, according to the polymorphism rule. A join point cannot be polymorphic in its return type, since given join j a b x y z = e1 in e2, the types of e1 and e2 must be the same, and a and b are not in scope for e2. (See Note [The polymorphism rule of join points] in GHC.Core.) Returns False also if the type simply doesn't have enough arguments.

Note that we need to know how many arguments (type *and* value) the putative join point takes; for instance, if j :: forall a. a -> Int then j could be a binary join point returning an Int, but it could *not* be a unary join point returning a -> Int.

TODO: See Note [Excess polymorphism and join points]

isUnliftedTypeKind :: Kind -> Bool

Returns True if the kind classifies unlifted types (like 'Int#') and False otherwise. Note that this returns False for levity-polymorphic kinds, which may be specialized to a kind that classifies unlifted types.

isUnliftedType :: HasDebugCallStack => Type -> Bool

See Type for what an unlifted type is. Panics on levity polymorphic types; See mightBeUnliftedType for a more approximate predicate that behaves better in the presence of levity polymorphism.

isUnliftedRuntimeRep :: Type -> Bool

isUnliftedLevity :: Type -> Bool

isUnboxedTupleType :: Type -> Bool

isUnboxedSumType :: Type -> Bool

isTypeLevPoly :: Type -> Bool

Returns True if a type is levity polymorphic. Should be the same as (isKindLevPoly . typeKind) but much faster. Precondition: The type has kind (TYPE blah)

isTyVarTy :: Type -> Bool

isTauTy :: Type -> Bool

isStrictType :: HasDebugCallStack => Type -> Bool

Computes whether an argument (or let right hand side) should be computed strictly or lazily, based only on its type. Currently, it's just isUnliftedType. Panics on levity-polymorphic types.

isStrLitTy :: Type -> Maybe FastString

Is this a symbol literal. We also look through type synonyms.

isRuntimeRepVar :: TyVar -> Bool

Is a tyvar of type RuntimeRep?

isRuntimeRepKindedTy :: Type -> Bool

Is this a type of kind RuntimeRep? (e.g. LiftedRep)

isPrimitiveType :: Type -> Bool

Returns true of types that are opaque to Haskell.

isPiTy :: Type -> Bool

Is this a function or forall?

isOneDataConTy :: Mult -> Bool

isNumLitTy :: Type -> Maybe Integer

Is this a numeric literal. We also look through type synonyms.

isMultiplicityVar :: TyVar -> Bool

Is a tyvar of type Multiplicity?

isManyDataConTy :: Mult -> Bool

isLitTy :: Type -> Maybe TyLit

Is this a type literal (symbol, numeric, or char)?

isLinearType :: Type -> Bool

isLinear t returns True of a if t is a type of (curried) function where at least one argument is linear (or otherwise non-unrestricted). We use this function to check whether it is safe to eta reduce an Id in CorePrep. It is always safe to return True, because True deactivates the optimisation.

isLiftedType_maybe :: HasDebugCallStack => Type -> Maybe Bool

Returns Just True if this type is surely lifted, Just False if it is surely unlifted, Nothing if we can't be sure (i.e., it is levity polymorphic), and panics if the kind does not have the shape TYPE r.

isLiftedRuntimeRep :: Type -> Bool

isLiftedLevity :: Type -> Bool

isLevityVar :: TyVar -> Bool

Is a tyvar of type Levity?

isLevityTy :: Type -> Bool

Is this the type Levity?

isKindLevPoly :: Kind -> Bool

Tests whether the given kind (which should look like TYPE x) is something other than a constructor tree (that is, constructors at every node). E.g. True of TYPE k, TYPE (F Int) False of TYPE 'LiftedRep

isFunTy :: Type -> Bool

Is this a function?

isForAllTy_ty :: Type -> Bool

Like isForAllTy, but returns True only if it is a tyvar binder

isForAllTy_co :: Type -> Bool

Like isForAllTy, but returns True only if it is a covar binder

isForAllTy :: Type -> Bool

Checks whether this is a proper forall (with a named binder)

isFamFreeTy :: Type -> Bool

isDataFamilyAppType :: Type -> Bool

Check whether a type is a data family type

isCoercionTy_maybe :: Type -> Maybe Coercion

isCoVarType :: Type -> Bool

Does this type classify a core (unlifted) Coercion? At either role nominal or representational (t1 ~# t2) or (t1 ~R# t2) See Note [Types for coercions, predicates, and evidence] in GHC.Core.TyCo.Rep

isCharLitTy :: Type -> Maybe Char

Is this a char literal? We also look through type synonyms.

isBoxedTypeKind :: Kind -> Bool

Returns True if the kind classifies types which are allocated on the GC'd heap and False otherwise. Note that this returns False for levity-polymorphic kinds, which may be specialized to a kind that classifies AddrRep or even unboxed kinds.

isBoxedType :: Type -> Bool

See Type for what a boxed type is. Panics on levity polymorphic types; See mightBeUnliftedType for a more approximate predicate that behaves better in the presence of levity polymorphism.

isBoxedRuntimeRep :: Type -> Bool

See isBoxedRuntimeRep_maybe.

isAtomicTy :: Type -> Bool

isAnonTyCoBinder :: TyCoBinder -> Bool

Does this binder bind a variable that is not erased? Returns True for anonymous binders.

isAlgType :: Type -> Bool

See Type for what an algebraic type is. Should only be applied to types, as opposed to e.g. partially saturated type constructors

irrelevantMult :: Scaled a -> a

invisibleTyBndrCount :: Type -> Int

getTyVar_maybe :: Type -> Maybe TyVar

Attempts to obtain the type variable underlying a Type

getTyVar :: String -> Type -> TyVar

Attempts to obtain the type variable underlying a Type, and panics with the given message if this is not a type variable type. See also getTyVar_maybe

getRuntimeRep_maybe :: HasDebugCallStack => Type -> Maybe Type

Extract the RuntimeRep classifier of a type. For instance, getRuntimeRep_maybe Int = LiftedRep. Returns Nothing if this is not possible.

getRuntimeRep :: HasDebugCallStack => Type -> Type

Extract the RuntimeRep classifier of a type. For instance, getRuntimeRep_maybe Int = LiftedRep. Panics if this is not possible.

getCastedTyVar_maybe :: Type -> Maybe (TyVar, CoercionN)

If the type is a tyvar, possibly under a cast, returns it, along with the coercion. Thus, the co is :: kind tv ~N kind ty

funResultTy :: Type -> Type

Extract the function result type and panic if that is not possible

funArgTy :: Type -> Type

Just like piResultTys but for a single argument Try not to iterate piResultTy, because it's inefficient to substitute one variable at a time; instead use 'piResultTys"

Extract the function argument type and panic if that is not possible

filterOutInvisibleTypes :: TyCon -> [Type] -> [Type]

Given a TyCon and a list of argument types, filter out any invisible (i.e., Inferred or Specified) arguments.

filterOutInferredTypes :: TyCon -> [Type] -> [Type]

Given a TyCon and a list of argument types, filter out any Inferred arguments.

expandTypeSynonyms :: Type -> Type

Expand out all type synonyms. Actually, it'd suffice to expand out just the ones that discard type variables (e.g. type Funny a = Int) But we don't know which those are currently, so we just expand all.

expandTypeSynonyms only expands out type synonyms mentioned in the type, not in the kinds of any TyCon or TyVar mentioned in the type.

Keep this synchronized with synonymTyConsOfType

eqVarBndrs :: RnEnv2 -> [Var] -> [Var] -> Maybe RnEnv2

eqTypes :: [Type] -> [Type] -> Bool

Type equality on lists of types, looking through type synonyms but not newtypes.

eqTypeX :: RnEnv2 -> Type -> Type -> Bool

Compare types with respect to a (presumably) non-empty RnEnv2.

eqType :: Type -> Type -> Bool

Type equality on source types. Does not look through newtypes or PredTypes, but it does look through type synonyms. This first checks that the kinds of the types are equal and then checks whether the types are equal, ignoring casts and coercions. (The kind check is a recursive call, but since all kinds have type Type, there is no need to check the types of kinds.) See also Note [Non-trivial definitional equality] in GHC.Core.TyCo.Rep.

dropRuntimeRepArgs :: [Type] -> [Type]

Drops prefix of RuntimeRep constructors in TyConApps. Useful for e.g. dropping 'LiftedRep arguments of unboxed tuple TyCon applications:

dropRuntimeRepArgs [ 'LiftedRep, 'IntRep , String, Int# ] == [String, Int#]

dropForAlls :: Type -> Type

Drops all ForAllTys

coAxNthLHS :: forall (br :: BranchFlag). CoAxiom br -> Int -> Type

Get the type on the LHS of a coercion induced by a type/data family instance.

classifiesTypeWithValues :: Kind -> Bool

Does this classify a type allowed to have values? Responds True to things like *, #, TYPE Lifted, TYPE v, Constraint.

True of any sub-kind of OpenTypeKind

buildSynTyCon

Arguments

:: Name

-> [KnotTied TyConBinder]

-> Kind

result kind

-> [Role]

-> KnotTied Type

-> TyCon

binderRelevantType_maybe :: TyCoBinder -> Maybe Type

Extract a relevant type, if there is one.

applyTysX :: [TyVar] -> Type -> [Type] -> Type

appTyArgFlags :: Type -> [Type] -> [ArgFlag]

Given a Type and a list of argument types to which the Type is applied, determine each argument's visibility (Inferred, Specified, or Required).

Most of the time, the arguments will be Required, but not always. Consider f :: forall a. a -> Type. In f Type Bool, the first argument (Type) is Specified and the second argument (Bool) is Required. It is precisely this sort of higher-rank situation in which appTyArgFlags comes in handy, since f Type Bool would be represented in Core using AppTys. (See also #15792).

pattern One :: Mult

pattern Many :: Mult

funTyCon :: TyCon

The FUN type constructor.

FUN :: forall (m :: Multiplicity) ->
       forall {rep1 :: RuntimeRep} {rep2 :: RuntimeRep}.
       TYPE rep1 -> TYPE rep2 -> *

The runtime representations quantification is left inferred. This means they cannot be specified with -XTypeApplications.

This is a deliberate choice to allow future extensions to the function arrow. To allow visible application a type synonym can be defined:

type Arr :: forall (rep1 :: RuntimeRep) (rep2 :: RuntimeRep).
            TYPE rep1 -> TYPE rep2 -> Type
type Arr = FUN 'Many

type TvSubstEnv = TyVarEnv Type

A substitution of Types for TyVars and Kinds for KindVars

data TCvSubst

Type & coercion substitution

The following invariants must hold of a TCvSubst:

1. The in-scope set is needed only to guide the generation of fresh uniques
2. In particular, the kind of the type variables in the in-scope set is not relevant
3. The substitution is only applied ONCE! This is because in general such application will not reach a fixed point.

Constructors

TCvSubst InScopeSet TvSubstEnv CvSubstEnv

Instances

Outputable TCvSubst

Defined in GHC.Core.TyCo.Subst

Methods

ppr :: TCvSubst -> SDoc

zipTyEnv :: HasDebugCallStack => [TyVar] -> [Type] -> TvSubstEnv

zipTvSubst :: HasDebugCallStack => [TyVar] -> [Type] -> TCvSubst

Generates the in-scope set for the TCvSubst from the types in the incoming environment. No CoVars, please!

zipTCvSubst :: HasDebugCallStack => [TyCoVar] -> [Type] -> TCvSubst

zipCoEnv :: HasDebugCallStack => [CoVar] -> [Coercion] -> CvSubstEnv

zapTCvSubst :: TCvSubst -> TCvSubst

unionTCvSubst :: TCvSubst -> TCvSubst -> TCvSubst

substVarBndrs :: HasCallStack => TCvSubst -> [TyCoVar] -> (TCvSubst, [TyCoVar])

substVarBndr :: HasCallStack => TCvSubst -> TyCoVar -> (TCvSubst, TyCoVar)

substTysWith :: [TyVar] -> [Type] -> [Type] -> [Type]

Type substitution, see zipTvSubst

substTysUnchecked :: TCvSubst -> [Type] -> [Type]

Substitute within several Types disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTysUnchecked to substTys and remove this function. Please don't use in new code.

substTys :: HasCallStack => TCvSubst -> [Type] -> [Type]

Substitute within several Types The substitution has to satisfy the invariants described in Note [The substitution invariant].

substTyWithUnchecked :: [TyVar] -> [Type] -> Type -> Type

Type substitution, see zipTvSubst. Disables sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.

substTyWith :: HasCallStack => [TyVar] -> [Type] -> Type -> Type

Type substitution, see zipTvSubst

substTyVars :: TCvSubst -> [TyVar] -> [Type]

substTyVarBndrs :: HasCallStack => TCvSubst -> [TyVar] -> (TCvSubst, [TyVar])

substTyVarBndr :: HasCallStack => TCvSubst -> TyVar -> (TCvSubst, TyVar)

substTyVar :: TCvSubst -> TyVar -> Type

substTyUnchecked :: TCvSubst -> Type -> Type

Substitute within a Type disabling the sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.

substTyCoBndr :: TCvSubst -> TyCoBinder -> (TCvSubst, TyCoBinder)

substTyAddInScope :: TCvSubst -> Type -> Type

Substitute within a Type after adding the free variables of the type to the in-scope set. This is useful for the case when the free variables aren't already in the in-scope set or easily available. See also Note [The substitution invariant].

substTy :: HasCallStack => TCvSubst -> Type -> Type

Substitute within a Type The substitution has to satisfy the invariants described in Note [The substitution invariant].

substThetaUnchecked :: TCvSubst -> ThetaType -> ThetaType

Substitute within a ThetaType disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substThetaUnchecked to substTheta and remove this function. Please don't use in new code.

substTheta :: HasCallStack => TCvSubst -> ThetaType -> ThetaType

Substitute within a ThetaType The substitution has to satisfy the invariants described in Note [The substitution invariant].

substScaledTysUnchecked :: TCvSubst -> [Scaled Type] -> [Scaled Type]

substScaledTys :: HasCallStack => TCvSubst -> [Scaled Type] -> [Scaled Type]

substScaledTyUnchecked :: HasCallStack => TCvSubst -> Scaled Type -> Scaled Type

substScaledTy :: HasCallStack => TCvSubst -> Scaled Type -> Scaled Type

substCoWithUnchecked :: [TyVar] -> [Type] -> Coercion -> Coercion

Coercion substitution, see zipTvSubst. Disables sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.

substCoUnchecked :: TCvSubst -> Coercion -> Coercion

Substitute within a Coercion disabling sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.

setTvSubstEnv :: TCvSubst -> TvSubstEnv -> TCvSubst

notElemTCvSubst :: Var -> TCvSubst -> Bool

mkTvSubstPrs :: [(TyVar, Type)] -> TCvSubst

Generates the in-scope set for the TCvSubst from the types in the incoming environment. No CoVars, please!

mkTCvSubst :: InScopeSet -> (TvSubstEnv, CvSubstEnv) -> TCvSubst

mkEmptyTCvSubst :: InScopeSet -> TCvSubst

lookupTyVar :: TCvSubst -> TyVar -> Maybe Type

isInScope :: Var -> TCvSubst -> Bool

isEmptyTCvSubst :: TCvSubst -> Bool

getTvSubstEnv :: TCvSubst -> TvSubstEnv

getTCvSubstRangeFVs :: TCvSubst -> VarSet

Returns the free variables of the types in the range of a substitution as a non-deterministic set.

getTCvInScope :: TCvSubst -> InScopeSet

extendTvSubstWithClone :: TCvSubst -> TyVar -> TyVar -> TCvSubst

extendTvSubstList :: TCvSubst -> [Var] -> [Type] -> TCvSubst

extendTvSubstBinderAndInScope :: TCvSubst -> TyCoBinder -> Type -> TCvSubst

extendTvSubstAndInScope :: TCvSubst -> TyVar -> Type -> TCvSubst

extendTvSubst :: TCvSubst -> TyVar -> Type -> TCvSubst

extendTCvSubstWithClone :: TCvSubst -> TyCoVar -> TyCoVar -> TCvSubst

extendTCvSubstList :: TCvSubst -> [Var] -> [Type] -> TCvSubst

extendTCvSubst :: TCvSubst -> TyCoVar -> Type -> TCvSubst

extendTCvInScopeSet :: TCvSubst -> VarSet -> TCvSubst

extendTCvInScopeList :: TCvSubst -> [Var] -> TCvSubst

extendTCvInScope :: TCvSubst -> Var -> TCvSubst

extendCvSubst :: TCvSubst -> CoVar -> Coercion -> TCvSubst

emptyTvSubstEnv :: TvSubstEnv

emptyTCvSubst :: TCvSubst

composeTCvSubstEnv :: InScopeSet -> (TvSubstEnv, CvSubstEnv) -> (TvSubstEnv, CvSubstEnv) -> (TvSubstEnv, CvSubstEnv)

(compose env1 env2)(x) is env1(env2(x)); i.e. apply env2 then env1. It assumes that both are idempotent. Typically, env1 is the refinement to a base substitution env2

composeTCvSubst :: TCvSubst -> TCvSubst -> TCvSubst

Composes two substitutions, applying the second one provided first, like in function composition.

cloneTyVarBndrs :: TCvSubst -> [TyVar] -> UniqSupply -> (TCvSubst, [TyVar])

cloneTyVarBndr :: TCvSubst -> TyVar -> Unique -> (TCvSubst, TyVar)

tidyVarBndrs :: TidyEnv -> [TyCoVar] -> (TidyEnv, [TyCoVar])

This tidies up a type for printing in an error message, or in an interface file.

It doesn't change the uniques at all, just the print names.

tidyVarBndr :: TidyEnv -> TyCoVar -> (TidyEnv, TyCoVar)

tidyTypes :: TidyEnv -> [Type] -> [Type]

Tidy a list of Types

See Note [Strictness in tidyType and friends]

tidyType :: TidyEnv -> Type -> Type

Tidy a Type

See Note [Strictness in tidyType and friends]

tidyTyCoVarOcc :: TidyEnv -> TyCoVar -> TyCoVar

tidyTyCoVarBinders :: TidyEnv -> [VarBndr TyCoVar vis] -> (TidyEnv, [VarBndr TyCoVar vis])

tidyTyCoVarBinder :: TidyEnv -> VarBndr TyCoVar vis -> (TidyEnv, VarBndr TyCoVar vis)

tidyTopType :: Type -> Type

Calls tidyType on a top-level type (i.e. with an empty tidying environment)

tidyOpenTypes :: TidyEnv -> [Type] -> (TidyEnv, [Type])

Grabs the free type variables, tidies them and then uses tidyType to work over the type itself

tidyOpenType :: TidyEnv -> Type -> (TidyEnv, Type)

tidyOpenTyCoVars :: TidyEnv -> [TyCoVar] -> (TidyEnv, [TyCoVar])

tidyOpenTyCoVar :: TidyEnv -> TyCoVar -> (TidyEnv, TyCoVar)

Treat a new TyCoVar as a binder, and give it a fresh tidy name using the environment if one has not already been allocated. See also tidyVarBndr

tidyOpenKind :: TidyEnv -> Kind -> (TidyEnv, Kind)

tidyKind :: TidyEnv -> Kind -> Kind

tidyFreeTyCoVars :: TidyEnv -> [TyCoVar] -> TidyEnv

Add the free TyVars to the env in tidy form, so that we can tidy the type they are free in

tyCoVarsOfTypesWellScoped :: [Type] -> [TyVar]

Get the free vars of types in scoped order

tyCoVarsOfTypes :: [Type] -> TyCoVarSet

tyCoVarsOfTypeWellScoped :: Type -> [TyVar]

Get the free vars of a type in scoped order

tyCoVarsOfTypeDSet :: Type -> DTyCoVarSet

tyCoFVsOfType that returns free variables of a type in a deterministic set. For explanation of why using VarSet is not deterministic see Note [Deterministic FV] in GHC.Utils.FV.

tyCoVarsOfType :: Type -> TyCoVarSet

tyCoFVsVarBndrs :: [Var] -> FV -> FV

tyCoFVsVarBndr :: Var -> FV -> FV

tyCoFVsOfType :: Type -> FV

The worker for tyCoFVsOfType and tyCoFVsOfTypeList. The previous implementation used unionVarSet which is O(n+m) and can make the function quadratic. It's exported, so that it can be composed with other functions that compute free variables. See Note [FV naming conventions] in GHC.Utils.FV.

Eta-expanded because that makes it run faster (apparently) See Note [FV eta expansion] in GHC.Utils.FV for explanation.

tyCoFVsBndr :: TyCoVarBinder -> FV -> FV

scopedSort :: [TyCoVar] -> [TyCoVar]

Do a topological sort on a list of tyvars, so that binders occur before occurrences E.g. given [ a::k, k::*, b::k ] it'll return a well-scoped list [ k::*, a::k, b::k ]

This is a deterministic sorting operation (that is, doesn't depend on Uniques).

It is also meant to be stable: that is, variables should not be reordered unnecessarily. This is specified in Note [ScopedSort] See also Note [Ordering of implicit variables] in GHC.Rename.HsType

noFreeVarsOfType :: Type -> Bool

coVarsOfTypes :: [Type] -> CoVarSet

coVarsOfType :: Type -> CoVarSet

closeOverKindsList :: [TyVar] -> [TyVar]

Add the kind variables free in the kinds of the tyvars in the given set. Returns a deterministically ordered list.

closeOverKindsDSet :: DTyVarSet -> DTyVarSet

Add the kind variables free in the kinds of the tyvars in the given set. Returns a deterministic set.

closeOverKinds :: TyCoVarSet -> TyCoVarSet

anyFreeVarsOfTypes :: (TyCoVar -> Bool) -> [Type] -> Bool

anyFreeVarsOfType :: (TyCoVar -> Bool) -> Type -> Bool

data TyCoFolder env a

Constructors

TyCoFolder

Fields

• tcf_view :: Type -> Maybe Type
• tcf_tyvar :: env -> TyVar -> a
• tcf_covar :: env -> CoVar -> a
• tcf_hole :: env -> CoercionHole -> a

  What to do with coercion holes. See Note [Coercion holes] in GHC.Core.TyCo.Rep.

• tcf_tycobinder :: env -> TyCoVar -> ArgFlag -> env

  The returned env is used in the extended scope

type KnotTied ty = ty

A type labeled KnotTied might have knot-tied tycons in it. See Note [Type checking recursive type and class declarations] in GHC.Tc.TyCl

type KindOrType = Type

The key representation of types within the compiler

typeSize :: Type -> Int

mkVisFunTysMany :: [Type] -> Type -> Type

mkVisFunTys :: [Scaled Type] -> Type -> Type

Make nested arrow types

mkVisFunTyMany :: Type -> Type -> Type infixr 3

Special, common, case: Arrow type with mult Many

mkVisFunTy :: Mult -> Type -> Type -> Type infixr 3

mkTyVarTys :: [TyVar] -> [Type]

mkTyVarTy :: TyVar -> Type

mkPiTys :: [TyCoBinder] -> Type -> Type

mkPiTy :: TyCoBinder -> Type -> Type

mkInvisFunTysMany :: [Type] -> Type -> Type

mkInvisFunTyMany :: Type -> Type -> Type infixr 3

mkInvisFunTy :: Mult -> Type -> Type -> Type infixr 3

mkInvisForAllTys :: [InvisTVBinder] -> Type -> Type

Wraps foralls over the type using the provided InvisTVBinders from left to right

mkFunTy :: AnonArgFlag -> Mult -> Type -> Type -> Type infixr 3

mkForAllTys :: [TyCoVarBinder] -> Type -> Type

Wraps foralls over the type using the provided TyCoVars from left to right

isVisibleBinder :: TyCoBinder -> Bool

Does this binder bind a visible argument?

isNamedBinder :: TyCoBinder -> Bool

isInvisibleBinder :: TyCoBinder -> Bool

Does this binder bind an invisible argument?

foldTyCo :: Monoid a => TyCoFolder env a -> env -> (Type -> a, [Type] -> a, Coercion -> a, [Coercion] -> a)

isConstraintKindCon :: TyCon -> Bool

Returns True for the TyCon of the Constraint kind.

type TyVarBinder = VarBndr TyVar ArgFlag

type TyCoVarBinder = VarBndr TyCoVar ArgFlag

Variable Binder

A TyCoVarBinder is the binder of a ForAllTy It's convenient to define this synonym here rather its natural home in GHC.Core.TyCo.Rep, because it's used in GHC.Core.DataCon.hs-boot

A TyVarBinder is a binder with only TyVar

tyVarSpecToBinders :: [VarBndr a Specificity] -> [VarBndr a ArgFlag]

tyVarKind :: TyVar -> Kind

sameVis :: ArgFlag -> ArgFlag -> Bool

Do these denote the same level of visibility? Required arguments are visible, others are not. So this function equates Specified and Inferred. Used for printing.

mkTyVarBinders :: vis -> [TyVar] -> [VarBndr TyVar vis]

Make many named binders Input vars should be type variables

mkTyVarBinder :: vis -> TyVar -> VarBndr TyVar vis

Make a named binder var should be a type variable

mkTyCoVarBinders :: vis -> [TyCoVar] -> [VarBndr TyCoVar vis]

Make many named binders

mkTyCoVarBinder :: vis -> TyCoVar -> VarBndr TyCoVar vis

Make a named binder

isVisibleArgFlag :: ArgFlag -> Bool

Does this ArgFlag classify an argument that is written in Haskell?

isTyVar :: Var -> Bool

Is this a type-level (i.e., computationally irrelevant, thus erasable) variable? Satisfies isTyVar = not . isId.

isInvisibleArgFlag :: ArgFlag -> Bool

Does this ArgFlag classify an argument that is not written in Haskell?

binderVars :: [VarBndr tv argf] -> [tv]

binderVar :: VarBndr tv argf -> tv

binderType :: VarBndr TyCoVar argf -> Type

binderArgFlag :: VarBndr tv argf -> argf

unrestrictedFunTyCon :: TyCon

unliftedTypeKind :: Kind

liftedTypeKind :: Kind

tyConAppTyCon_maybe :: Type -> Maybe TyCon

The same as fst . splitTyConApp

tcView :: Type -> Maybe Type

Gives the typechecker view of a type. This unwraps synonyms but leaves Constraint alone. c.f. coreView, which turns Constraint into Type. Returns Nothing if no unwrapping happens. See also Note [coreView vs tcView]

tYPE :: Type -> Type

Given a RuntimeRep, applies TYPE to it. See Note [TYPE and RuntimeRep] in GHC.Builtin.Types.Prim.

splitTyConApp_maybe :: HasDebugCallStack => Type -> Maybe (TyCon, [Type])

Attempts to tease a type apart into a type constructor and the application of a number of arguments to that constructor

piResultTy :: HasDebugCallStack => Type -> Type -> Type

partitionInvisibleTypes :: TyCon -> [Type] -> ([Type], [Type])

Given a TyCon and a list of argument types, partition the arguments into:

1. Inferred or Specified (i.e., invisible) arguments and
2. Required (i.e., visible) arguments

mkTyConTy :: TyCon -> Type

Create the plain type constructor type which has been applied to no type arguments at all.

mkTyConApp :: TyCon -> [Type] -> Type

A key function: builds a TyConApp or FunTy as appropriate to its arguments. Applies its arguments to the constructor from left to right.

mkCastTy :: Type -> Coercion -> Type

Make a CastTy. The Coercion must be nominal. Checks the Coercion for reflexivity, dropping it if it's reflexive. See Note [Respecting definitional equality] in GHC.Core.TyCo.Rep

mkAppTy :: Type -> Type -> Type

Applies a type to another, as in e.g. k a

isRuntimeRepTy :: Type -> Bool

Is this the type RuntimeRep?

isPredTy :: HasDebugCallStack => Type -> Bool

isMultiplicityTy :: Type -> Bool

Is this the type Multiplicity?

isLiftedTypeKind :: Kind -> Bool

This version considers Constraint to be the same as *. Returns True if the argument is equivalent to Type/Constraint and False otherwise. See Note [Kind Constraint and kind Type]

isCoercionTy :: Type -> Bool

coreView :: Type -> Maybe Type

This function strips off the top layer only of a type synonym application (if any) its underlying representation type. Returns Nothing if there is nothing to look through. This function considers Constraint to be a synonym of Type.

By being non-recursive and inlined, this case analysis gets efficiently joined onto the case analysis that the caller is already doing

data Type

Instances

Data Type

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Type -> c Type

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Type

toConstr :: Type -> Constr

dataTypeOf :: Type -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Type)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Type)

gmapT :: (forall b. Data b => b -> b) -> Type -> Type

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Type -> r

gmapQ :: (forall d. Data d => d -> u) -> Type -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Type -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Type -> m Type

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Type -> m Type

NFData Type

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: Type -> ()

Outputable Type

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Type -> SDoc

Eq (DeBruijn Type)

Defined in GHC.Core.Map.Type

Methods

(==) :: DeBruijn Type -> DeBruijn Type -> Bool

(/=) :: DeBruijn Type -> DeBruijn Type -> Bool

data TyCoBinder

A TyCoBinder represents an argument to a function. TyCoBinders can be dependent (Named) or nondependent (Anon). They may also be visible or not. See Note [TyCoBinders]

Instances

Data TyCoBinder

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TyCoBinder -> c TyCoBinder

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TyCoBinder

toConstr :: TyCoBinder -> Constr

dataTypeOf :: TyCoBinder -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TyCoBinder)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TyCoBinder)

gmapT :: (forall b. Data b => b -> b) -> TyCoBinder -> TyCoBinder

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TyCoBinder -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TyCoBinder -> r

gmapQ :: (forall d. Data d => d -> u) -> TyCoBinder -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TyCoBinder -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TyCoBinder -> m TyCoBinder

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TyCoBinder -> m TyCoBinder

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TyCoBinder -> m TyCoBinder

Outputable TyCoBinder

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: TyCoBinder -> SDoc

type ThetaType = [PredType]

A collection of PredTypes

data Scaled a

A shorthand for data with an attached Mult element (the multiplicity).

Instances

Data a => Data (Scaled a)

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Scaled a -> c (Scaled a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Scaled a)

toConstr :: Scaled a -> Constr

dataTypeOf :: Scaled a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Scaled a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Scaled a))

gmapT :: (forall b. Data b => b -> b) -> Scaled a -> Scaled a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Scaled a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Scaled a -> r

gmapQ :: (forall d. Data d => d -> u) -> Scaled a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Scaled a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Scaled a -> m (Scaled a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Scaled a -> m (Scaled a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Scaled a -> m (Scaled a)

Outputable a => Outputable (Scaled a)

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: Scaled a -> SDoc

type PredType = Type

A type of the form p of constraint kind represents a value whose type is the Haskell predicate p, where a predicate is what occurs before the => in a Haskell type.

We use PredType as documentation to mark those types that we guarantee to have this kind.

It can be expanded into its representation, but:

• The type checker must treat it as opaque
• The rest of the compiler treats it as transparent

Consider these examples:

f :: (Eq a) => a -> Int
g :: (?x :: Int -> Int) => a -> Int
h :: (r\l) => {r} => {l::Int | r}

Here the Eq a and ?x :: Int -> Int and rl are all called "predicates"

type Mult = Type

Mult is a type alias for Type.

Mult must contain Type because multiplicity variables are mere type variables (of kind Multiplicity) in Haskell. So the simplest implementation is to make Mult be Type.

Multiplicities can be formed with: - One: GHC.Types.One (= oneDataCon) - Many: GHC.Types.Many (= manyDataCon) - Multiplication: GHC.Types.MultMul (= multMulTyCon)

So that Mult feels a bit more structured, we provide pattern synonyms and smart constructors for these.

type Kind = Type

The key type representing kinds in the compiler.

mkForAllTy :: TyCoVar -> ArgFlag -> Type -> Type

Like mkTyCoForAllTy, but does not check the occurrence of the binder See Note [Unused coercion variable in ForAllTy]

data Var

Variable

Essentially a typed Name, that may also contain some additional information about the Var and its use sites.

Instances

Data Var

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Var -> c Var

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Var

toConstr :: Var -> Constr

dataTypeOf :: Var -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Var)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Var)

gmapT :: (forall b. Data b => b -> b) -> Var -> Var

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Var -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Var -> r

gmapQ :: (forall d. Data d => d -> u) -> Var -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Var -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Var -> m Var

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Var -> m Var

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Var -> m Var

NamedThing Var

Defined in GHC.Types.Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

HasOccName Var

Defined in GHC.Types.Var

Methods

occName :: Var -> OccName

Uniquable Var

Defined in GHC.Types.Var

Methods

getUnique :: Var -> Unique

Outputable Var

Defined in GHC.Types.Var

Methods

ppr :: Var -> SDoc

Eq Var

Defined in GHC.Types.Var

Methods

(==) :: Var -> Var -> Bool

(/=) :: Var -> Var -> Bool

Ord Var

Defined in GHC.Types.Var

Methods

compare :: Var -> Var -> Ordering

(<) :: Var -> Var -> Bool

(<=) :: Var -> Var -> Bool

(>) :: Var -> Var -> Bool

(>=) :: Var -> Var -> Bool

max :: Var -> Var -> Var

min :: Var -> Var -> Var

ModifyState Id

Defined in Compat.HieAst

Methods

addSubstitution :: Id -> Id -> HieState -> HieState

ToHie (Context (Located Var))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Var) -> HieM [HieAST Type]

type Anno Id

Defined in GHC.Hs.Extension

type Anno Id = SrcSpanAnnN

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type TyVar = Var

Type or kind Variable

type TyCoVar = Id

Type or Coercion Variable

data Specificity

Whether an Invisible argument may appear in source Haskell.

Constructors

InferredSpec

the argument may not appear in source Haskell, it is only inferred.

SpecifiedSpec

the argument may appear in source Haskell, but isn't required.

Instances

Data Specificity

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Specificity -> c Specificity

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Specificity

toConstr :: Specificity -> Constr

dataTypeOf :: Specificity -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Specificity)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Specificity)

gmapT :: (forall b. Data b => b -> b) -> Specificity -> Specificity

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Specificity -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Specificity -> r

gmapQ :: (forall d. Data d => d -> u) -> Specificity -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Specificity -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Specificity -> m Specificity

Binary Specificity

Defined in GHC.Types.Var

Methods

put_ :: BinHandle -> Specificity -> IO ()

put :: BinHandle -> Specificity -> IO (Bin Specificity)

get :: BinHandle -> IO Specificity

Eq Specificity

Defined in GHC.Types.Var

Methods

(==) :: Specificity -> Specificity -> Bool

(/=) :: Specificity -> Specificity -> Bool

Ord Specificity

Defined in GHC.Types.Var

Methods

compare :: Specificity -> Specificity -> Ordering

(<) :: Specificity -> Specificity -> Bool

(<=) :: Specificity -> Specificity -> Bool

(>) :: Specificity -> Specificity -> Bool

(>=) :: Specificity -> Specificity -> Bool

max :: Specificity -> Specificity -> Specificity

min :: Specificity -> Specificity -> Specificity

OutputableBndrFlag Specificity p

Defined in GHC.Hs.Type

Methods

pprTyVarBndr :: HsTyVarBndr Specificity (GhcPass p) -> SDoc

ReifyFlag Specificity Specificity

Defined in GHC.Tc.Gen.Splice

Methods

reifyFlag :: Specificity0 -> Specificity

Outputable tv => Outputable (VarBndr tv Specificity)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv Specificity -> SDoc

data ArgFlag

Argument Flag

Is something required to appear in source Haskell (Required), permitted by request (Specified) (visible type application), or prohibited entirely from appearing in source Haskell (Inferred)? See Note [VarBndrs, TyCoVarBinders, TyConBinders, and visibility] in GHC.Core.TyCo.Rep

Constructors

Invisible Specificity

Required

Bundled Patterns

pattern Specified :: ArgFlag

pattern Inferred :: ArgFlag

Instances

Data ArgFlag

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ArgFlag -> c ArgFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ArgFlag

toConstr :: ArgFlag -> Constr

dataTypeOf :: ArgFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ArgFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ArgFlag)

gmapT :: (forall b. Data b => b -> b) -> ArgFlag -> ArgFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ArgFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ArgFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> ArgFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ArgFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ArgFlag -> m ArgFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ArgFlag -> m ArgFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ArgFlag -> m ArgFlag

Binary ArgFlag

Defined in GHC.Types.Var

Methods

put_ :: BinHandle -> ArgFlag -> IO ()

put :: BinHandle -> ArgFlag -> IO (Bin ArgFlag)

get :: BinHandle -> IO ArgFlag

Outputable ArgFlag

Defined in GHC.Types.Var

Methods

ppr :: ArgFlag -> SDoc

Eq ArgFlag

Defined in GHC.Types.Var

Methods

(==) :: ArgFlag -> ArgFlag -> Bool

(/=) :: ArgFlag -> ArgFlag -> Bool

Ord ArgFlag

Defined in GHC.Types.Var

Methods

compare :: ArgFlag -> ArgFlag -> Ordering

(<) :: ArgFlag -> ArgFlag -> Bool

(<=) :: ArgFlag -> ArgFlag -> Bool

(>) :: ArgFlag -> ArgFlag -> Bool

(>=) :: ArgFlag -> ArgFlag -> Bool

max :: ArgFlag -> ArgFlag -> ArgFlag

min :: ArgFlag -> ArgFlag -> ArgFlag

Outputable tv => Outputable (VarBndr tv ArgFlag)

Defined in GHC.Types.Var

Methods

ppr :: VarBndr tv ArgFlag -> SDoc

data AnonArgFlag

The non-dependent version of ArgFlag. See Note [AnonArgFlag] Appears here partly so that it's together with its friends ArgFlag and ForallVisFlag, but also because it is used in IfaceType, rather early in the compilation chain

Constructors

VisArg

Used for (->): an ordinary non-dependent arrow. The argument is visible in source code.

InvisArg

Used for (=>): a non-dependent predicate arrow. The argument is invisible in source code.

Instances

Data AnonArgFlag

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> AnonArgFlag -> c AnonArgFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c AnonArgFlag

toConstr :: AnonArgFlag -> Constr

dataTypeOf :: AnonArgFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c AnonArgFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c AnonArgFlag)

gmapT :: (forall b. Data b => b -> b) -> AnonArgFlag -> AnonArgFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> AnonArgFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> AnonArgFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> AnonArgFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> AnonArgFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> AnonArgFlag -> m AnonArgFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> AnonArgFlag -> m AnonArgFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> AnonArgFlag -> m AnonArgFlag

Binary AnonArgFlag

Defined in GHC.Types.Var

Methods

put_ :: BinHandle -> AnonArgFlag -> IO ()

put :: BinHandle -> AnonArgFlag -> IO (Bin AnonArgFlag)

get :: BinHandle -> IO AnonArgFlag

Outputable AnonArgFlag

Defined in GHC.Types.Var

Methods

ppr :: AnonArgFlag -> SDoc

Eq AnonArgFlag

Defined in GHC.Types.Var

Methods

(==) :: AnonArgFlag -> AnonArgFlag -> Bool

(/=) :: AnonArgFlag -> AnonArgFlag -> Bool

Ord AnonArgFlag

Defined in GHC.Types.Var

Methods

compare :: AnonArgFlag -> AnonArgFlag -> Ordering

(<) :: AnonArgFlag -> AnonArgFlag -> Bool

(<=) :: AnonArgFlag -> AnonArgFlag -> Bool

(>) :: AnonArgFlag -> AnonArgFlag -> Bool

(>=) :: AnonArgFlag -> AnonArgFlag -> Bool

max :: AnonArgFlag -> AnonArgFlag -> AnonArgFlag

min :: AnonArgFlag -> AnonArgFlag -> AnonArgFlag

module GHC.Core.Unify

module GHC.Core.Utils

module GHC.HsToCore.Docs

module GHC.HsToCore.Expr

module GHC.HsToCore.Monad

module GHC.Iface.Syntax

data XViaStrategyPs

Constructors

XViaStrategyPs (EpAnn [AddEpAnn]) (LHsSigType GhcPs)

Instances

Outputable XViaStrategyPs

Defined in GHC.Hs.Decls

Methods

ppr :: XViaStrategyPs -> SDoc

data HsRuleAnn

Constructors

HsRuleAnn

Fields

• ra_tyanns :: Maybe (AddEpAnn, AddEpAnn)

  The locations of forall and . for forall'd type vars Using AddEpAnn to capture possible unicode variants

• ra_tmanns :: Maybe (AddEpAnn, AddEpAnn)

  The locations of forall and . for forall'd term vars Using AddEpAnn to capture possible unicode variants

• ra_rest :: [AddEpAnn]

Instances

Data HsRuleAnn

Defined in GHC.Hs.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsRuleAnn -> c HsRuleAnn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsRuleAnn

toConstr :: HsRuleAnn -> Constr

dataTypeOf :: HsRuleAnn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsRuleAnn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsRuleAnn)

gmapT :: (forall b. Data b => b -> b) -> HsRuleAnn -> HsRuleAnn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleAnn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleAnn -> r

gmapQ :: (forall d. Data d => d -> u) -> HsRuleAnn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsRuleAnn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsRuleAnn -> m HsRuleAnn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleAnn -> m HsRuleAnn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleAnn -> m HsRuleAnn

Eq HsRuleAnn

Defined in GHC.Hs.Decls

Methods

(==) :: HsRuleAnn -> HsRuleAnn -> Bool

(/=) :: HsRuleAnn -> HsRuleAnn -> Bool

tyFamInstDeclName :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => TyFamInstDecl (GhcPass p) -> IdP (GhcPass p)

tyFamInstDeclLName :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => TyFamInstDecl (GhcPass p) -> LocatedN (IdP (GhcPass p))

tyClDeclLName :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => TyClDecl (GhcPass p) -> LocatedN (IdP (GhcPass p))

tcdName :: forall (p :: Pass). Anno (IdGhcP p) ~ SrcSpanAnnN => TyClDecl (GhcPass p) -> IdP (GhcPass p)

standaloneKindSigName :: forall (p :: Pass). StandaloneKindSig (GhcPass p) -> IdP (GhcPass p)

roleAnnotDeclName :: forall (p :: Pass). RoleAnnotDecl (GhcPass p) -> IdP (GhcPass p)

resultVariableName :: forall (a :: Pass). FamilyResultSig (GhcPass a) -> Maybe (IdP (GhcPass a))

Maybe return name of the result type variable

pprTyFamInstDecl :: forall (p :: Pass). OutputableBndrId p => TopLevelFlag -> TyFamInstDecl (GhcPass p) -> SDoc

pprTyClDeclFlavour :: forall (p :: Pass). TyClDecl (GhcPass p) -> SDoc

pprHsFamInstLHS :: forall (p :: Pass). OutputableBndrId p => IdP (GhcPass p) -> HsOuterFamEqnTyVarBndrs (GhcPass p) -> HsTyPats (GhcPass p) -> LexicalFixity -> Maybe (LHsContext (GhcPass p)) -> SDoc

pprDataFamInstFlavour :: forall (p :: Pass). DataFamInstDecl (GhcPass p) -> SDoc

partitionBindsAndSigs :: [LHsDecl GhcPs] -> (LHsBinds GhcPs, [LSig GhcPs], [LFamilyDecl GhcPs], [LTyFamInstDecl GhcPs], [LDataFamInstDecl GhcPs], [LDocDecl GhcPs])

Partition a list of HsDecls into function/pattern bindings, signatures, type family declarations, type family instances, and documentation comments.

Panics when given a declaration that cannot be put into any of the output groups.

The primary use of this function is to implement cvBindsAndSigs.

mapDerivStrategy :: forall p (pass :: Pass). p ~ GhcPass pass => (XViaStrategy p -> XViaStrategy p) -> DerivStrategy p -> DerivStrategy p

Map over the via type if dealing with ViaStrategy. Otherwise, return the DerivStrategy unchanged.

instDeclDataFamInsts :: forall (p :: Pass). [LInstDecl (GhcPass p)] -> [DataFamInstDecl (GhcPass p)]

hsGroupTopLevelFixitySigs :: forall (p :: Pass). HsGroup (GhcPass p) -> [LFixitySig (GhcPass p)]

The fixity signatures for each top-level declaration and class method in an HsGroup. See Note [Top-level fixity signatures in an HsGroup]

hsDeclHasCusk :: TyClDecl GhcRn -> Bool

Does this declaration have a complete, user-supplied kind signature? See Note [CUSKs: complete user-supplied kind signatures]

hsConDeclTheta :: forall (p :: Pass). Maybe (LHsContext (GhcPass p)) -> [LHsType (GhcPass p)]

getRecConArgs_maybe :: ConDecl GhcRn -> Maybe (LocatedL [LConDeclField GhcRn])

Return Just fields if a data constructor declaration uses record syntax (i.e., RecCon), where fields are the field selectors. Otherwise, return Nothing.

getConNames :: ConDecl GhcRn -> [LocatedN Name]

foldDerivStrategy :: forall p (pass :: Pass) r. p ~ GhcPass pass => r -> (XViaStrategy p -> r) -> DerivStrategy p -> r

Eliminate a DerivStrategy.

flattenRuleDecls :: forall (p :: Pass). [LRuleDecls (GhcPass p)] -> [LRuleDecl (GhcPass p)]

familyDeclName :: forall (p :: Pass). FamilyDecl (GhcPass p) -> IdP (GhcPass p)

familyDeclLName :: forall (p :: Pass). FamilyDecl (GhcPass p) -> XRec (GhcPass p) (IdP (GhcPass p))

famResultKindSignature :: forall (p :: Pass). FamilyResultSig (GhcPass p) -> Maybe (LHsKind (GhcPass p))

emptyRnGroup :: forall (p :: Pass). HsGroup (GhcPass p)

emptyRdrGroup :: forall (p :: Pass). HsGroup (GhcPass p)

appendGroups :: forall (p :: Pass). HsGroup (GhcPass p) -> HsGroup (GhcPass p) -> HsGroup (GhcPass p)

data WarnDecls pass

Warning pragma Declarations

Constructors

Warnings

Fields

• wd_ext :: XWarnings pass
• wd_src :: SourceText
• wd_warnings :: [LWarnDecl pass]

XWarnDecls !(XXWarnDecls pass)

Instances

ToHie (LocatedA (WarnDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]

type Anno (WarnDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA

data WarnDecl pass

Warning pragma Declaration

Constructors

Warning (XWarning pass) [LIdP pass] WarningTxt

XWarnDecl !(XXWarnDecl pass)

Instances

ToHie (LocatedA (WarnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]

type Anno (WarnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA

type TyFamInstEqn pass = FamEqn pass (LHsType pass)

Type Family Instance Equation

data TyFamInstDecl pass

Type Family Instance Declaration

Constructors

TyFamInstDecl

• AnnKeywordId : AnnType, AnnInstance,

Fields

• tfid_xtn :: XCTyFamInstDecl pass
• tfid_eqn :: TyFamInstEqn pass

XTyFamInstDecl !(XXTyFamInstDecl pass)

Instances

ToHie (LocatedA (TyFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]

type Anno (TyFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA

type TyFamDefltDecl = TyFamInstDecl

Type family default declarations. A convenient synonym for TyFamInstDecl. See Note [Type family instance declarations in HsSyn].

data TyClGroup pass

Type or Class Group

Constructors

TyClGroup

Fields

• group_ext :: XCTyClGroup pass
• group_tyclds :: [LTyClDecl pass]
• group_roles :: [LRoleAnnotDecl pass]
• group_kisigs :: [LStandaloneKindSig pass]
• group_instds :: [LInstDecl pass]

XTyClGroup !(XXTyClGroup pass)

Instances

ToHie (TyClGroup GhcRn)

Defined in Compat.HieAst

Methods

toHie :: TyClGroup GhcRn -> HieM [HieAST Type]

data TyClDecl pass

A type or class declaration.

Constructors

FamDecl

type/data family T :: *->*

• AnnKeywordId : AnnType, AnnData, AnnFamily,AnnDcolon, AnnWhere,AnnOpenP, AnnDcolon,AnnCloseP, AnnEqual,AnnRarrow, AnnVbar

Fields

• tcdFExt :: XFamDecl pass
• tcdFam :: FamilyDecl pass

SynDecl

type declaration

• AnnKeywordId : AnnType, AnnEqual,

Fields

• tcdSExt :: XSynDecl pass

  Post renameer, FVs

• tcdLName :: LIdP pass

  Type constructor

• tcdTyVars :: LHsQTyVars pass

  Type variables; for an associated type these include outer binders

• tcdFixity :: LexicalFixity

  Fixity used in the declaration

• tcdRhs :: LHsType pass

  RHS of type declaration

DataDecl

data declaration

• AnnKeywordId : AnnData, AnnFamily, AnnNewType, AnnNewType,AnnDcolon AnnWhere,

Fields

• tcdDExt :: XDataDecl pass

  Post renamer, CUSK flag, FVs

• tcdLName :: LIdP pass

  Type constructor

• tcdTyVars :: LHsQTyVars pass

  Type variables; for an associated type these include outer binders

• tcdFixity :: LexicalFixity

  Fixity used in the declaration

• tcdDataDefn :: HsDataDefn pass

ClassDecl

Fields

• tcdCExt :: XClassDecl pass

  Post renamer, FVs

• tcdCtxt :: Maybe (LHsContext pass)

  Context...

• tcdLName :: LIdP pass

  Type constructor

• tcdTyVars :: LHsQTyVars pass

  Type variables; for an associated type these include outer binders

• tcdFixity :: LexicalFixity

  Fixity used in the declaration

• tcdFDs :: [LHsFunDep pass]

  Functional deps

• tcdSigs :: [LSig pass]

  Methods' signatures

• tcdMeths :: LHsBinds pass

  Default methods

• tcdATs :: [LFamilyDecl pass]

  Associated types;

• tcdATDefs :: [LTyFamDefltDecl pass]

  Associated type defaults

• tcdDocs :: [LDocDecl pass]

  Haddock docs

XTyClDecl !(XXTyClDecl pass)

Instances

ToHie (LocatedA (TyClDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]

type Anno (TyClDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA

data StandaloneKindSig pass

Constructors

StandaloneKindSig (XStandaloneKindSig pass) (LIdP pass) (LHsSigType pass)

XStandaloneKindSig !(XXStandaloneKindSig pass)

Instances

ToHie (LocatedA (StandaloneKindSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]

ToHie (StandaloneKindSig GhcRn)

Defined in Compat.HieAst

Methods

toHie :: StandaloneKindSig GhcRn -> HieM [HieAST Type]

type Anno (StandaloneKindSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA

data SpliceDecl p

Splice Declaration

Constructors

SpliceDecl (XSpliceDecl p) (XRec p (HsSplice p)) SpliceExplicitFlag

XSpliceDecl !(XXSpliceDecl p)

Instances

ToHie (LocatedA (SpliceDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]

type Anno (SpliceDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA

data RuleDecls pass

Rule Declarations

Constructors

HsRules

Fields

• rds_ext :: XCRuleDecls pass
• rds_src :: SourceText
• rds_rules :: [LRuleDecl pass]

XRuleDecls !(XXRuleDecls pass)

Instances

ToHie (LocatedA (RuleDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]

type Anno (RuleDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA

data RuleDecl pass

Rule Declaration

Constructors

HsRule

Fields

• rd_ext :: XHsRule pass

  After renamer, free-vars from the LHS and RHS

• rd_name :: XRec pass (SourceText, RuleName)

  Note [Pragma source text] in GHC.Types.Basic

• rd_act :: Activation
• rd_tyvs :: Maybe [LHsTyVarBndr () (NoGhcTc pass)]

  Forall'd type vars

• rd_tmvs :: [LRuleBndr pass]

  Forall'd term vars, before typechecking; after typechecking this includes all forall'd vars

• rd_lhs :: XRec pass (HsExpr pass)
• rd_rhs :: XRec pass (HsExpr pass)
  • AnnKeywordId : AnnOpen,AnnTilde, AnnVal, AnnClose, AnnForall,AnnDot, AnnEqual,

XRuleDecl !(XXRuleDecl pass)

Instances

ToHie (LocatedA (RuleDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]

type Anno (RuleDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA

data RuleBndr pass

Rule Binder

Constructors

RuleBndr (XCRuleBndr pass) (LIdP pass)

RuleBndrSig (XRuleBndrSig pass) (LIdP pass) (HsPatSigType pass)

XRuleBndr !(XXRuleBndr pass)

• AnnKeywordId : AnnOpen, AnnDcolon,AnnClose

Instances

ToHie (RScoped (Located (RuleBndr GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (Located (RuleBndr GhcRn)) -> HieM [HieAST Type]

type Anno (RuleBndr (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleBndr (GhcPass p)) = SrcSpan

data RoleAnnotDecl pass

Role Annotation Declaration

Constructors

RoleAnnotDecl (XCRoleAnnotDecl pass) (LIdP pass) [XRec pass (Maybe Role)]

• AnnKeywordId : AnnType, AnnRole

XRoleAnnotDecl !(XXRoleAnnotDecl pass)

Instances

ToHie (LocatedA (RoleAnnotDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]

type Anno (RoleAnnotDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA

data NewOrData

Constructors

NewType

newtype Blah ...

DataType

data Blah ...

Instances

Data NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NewOrData -> c NewOrData

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NewOrData

toConstr :: NewOrData -> Constr

dataTypeOf :: NewOrData -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NewOrData)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NewOrData)

gmapT :: (forall b. Data b => b -> b) -> NewOrData -> NewOrData

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NewOrData -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NewOrData -> r

gmapQ :: (forall d. Data d => d -> u) -> NewOrData -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NewOrData -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData

Outputable NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: NewOrData -> SDoc

Eq NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

(==) :: NewOrData -> NewOrData -> Bool

(/=) :: NewOrData -> NewOrData -> Bool

type LWarnDecls pass = XRec pass (WarnDecls pass)

Located Warning Declarations

type LWarnDecl pass = XRec pass (WarnDecl pass)

Located Warning pragma Declaration

type LTyFamInstEqn pass

Arguments

 = XRec pass (TyFamInstEqn pass)

May have AnnKeywordId : AnnSemi when in a list

Located Type Family Instance Equation

type LTyFamInstDecl pass = XRec pass (TyFamInstDecl pass)

Located Type Family Instance Declaration

type LTyFamDefltDecl pass = XRec pass (TyFamDefltDecl pass)

Located type family default declarations.

type LTyClDecl pass = XRec pass (TyClDecl pass)

Located Declaration of a Type or Class

type LStandaloneKindSig pass = XRec pass (StandaloneKindSig pass)

Located Standalone Kind Signature

type LSpliceDecl pass = XRec pass (SpliceDecl pass)

Located Splice Declaration

type LRuleDecls pass = XRec pass (RuleDecls pass)

Located Rule Declarations

type LRuleDecl pass = XRec pass (RuleDecl pass)

Located Rule Declaration

type LRuleBndr pass = XRec pass (RuleBndr pass)

Located Rule Binder

type LRoleAnnotDecl pass = XRec pass (RoleAnnotDecl pass)

Located Role Annotation Declaration

type LInstDecl pass = XRec pass (InstDecl pass)

Located Instance Declaration

type LInjectivityAnn pass = XRec pass (InjectivityAnn pass)

Located Injectivity Annotation

type LHsFunDep pass = XRec pass (FunDep pass)

type LHsDerivingClause pass = XRec pass (HsDerivingClause pass)

type LHsDecl p

Arguments

 = XRec p (HsDecl p)

When in a list this may have

• AnnKeywordId : AnnSemi

type LForeignDecl pass = XRec pass (ForeignDecl pass)

Located Foreign Declaration

type LFamilyResultSig pass = XRec pass (FamilyResultSig pass)

Located type Family Result Signature

type LFamilyDecl pass = XRec pass (FamilyDecl pass)

Located type Family Declaration

type LDocDecl pass = XRec pass DocDecl

Located Documentation comment Declaration

type LDerivStrategy pass = XRec pass (DerivStrategy pass)

A Located DerivStrategy.

type LDerivDecl pass = XRec pass (DerivDecl pass)

Located stand-alone 'deriving instance' declaration

type LDerivClauseTys pass = XRec pass (DerivClauseTys pass)

type LDefaultDecl pass = XRec pass (DefaultDecl pass)

Located Default Declaration

type LDataFamInstDecl pass = XRec pass (DataFamInstDecl pass)

Located Data Family Instance Declaration

type LConDecl pass

Arguments

 = XRec pass (ConDecl pass)

May have AnnKeywordId : AnnSemi when in a GADT constructor list

Located data Constructor Declaration

type LClsInstDecl pass = XRec pass (ClsInstDecl pass)

Located Class Instance Declaration

type LAnnDecl pass = XRec pass (AnnDecl pass)

Located Annotation Declaration

data InstDecl pass

Instance Declaration

Constructors

ClsInstD

Fields

• cid_d_ext :: XClsInstD pass
• cid_inst :: ClsInstDecl pass

DataFamInstD

Fields

• dfid_ext :: XDataFamInstD pass
• dfid_inst :: DataFamInstDecl pass

TyFamInstD

Fields

• tfid_ext :: XTyFamInstD pass
• tfid_inst :: TyFamInstDecl pass

XInstDecl !(XXInstDecl pass)

Instances

ToHie (LocatedA (InstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]

type Anno (InstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA

data InjectivityAnn pass

If the user supplied an injectivity annotation it is represented using InjectivityAnn. At the moment this is a single injectivity condition - see Note [Injectivity annotation]. `Located name` stores the LHS of injectivity condition. `[Located name]` stores the RHS of injectivity condition. Example:

type family Foo a b c = r | r -> a c where ...

This will be represented as "InjectivityAnn r [a, c]"

Constructors

InjectivityAnn (XCInjectivityAnn pass) (LIdP pass) [LIdP pass]

• AnnKeywordId : AnnRarrow, AnnVbar

XInjectivityAnn !(XXInjectivityAnn pass)

Instances

ToHie (Located (InjectivityAnn GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (InjectivityAnn GhcRn) -> HieM [HieAST Type]

type Anno (InjectivityAnn (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InjectivityAnn (GhcPass p)) = SrcSpan

type HsTyPats pass = [LHsTypeArg pass]

Haskell Type Patterns

data HsRuleRn

Constructors

HsRuleRn NameSet NameSet

Instances

Data HsRuleRn

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsRuleRn -> c HsRuleRn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsRuleRn

toConstr :: HsRuleRn -> Constr

dataTypeOf :: HsRuleRn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsRuleRn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsRuleRn)

gmapT :: (forall b. Data b => b -> b) -> HsRuleRn -> HsRuleRn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleRn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleRn -> r

gmapQ :: (forall d. Data d => d -> u) -> HsRuleRn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsRuleRn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn

data HsGroup p

Haskell Group

A HsDecl is categorised into a HsGroup before being fed to the renamer.

Constructors

HsGroup

Fields

• hs_ext :: XCHsGroup p
• hs_valds :: HsValBinds p
• hs_splcds :: [LSpliceDecl p]
• hs_tyclds :: [TyClGroup p]
• hs_derivds :: [LDerivDecl p]
• hs_fixds :: [LFixitySig p]
• hs_defds :: [LDefaultDecl p]
• hs_fords :: [LForeignDecl p]
• hs_warnds :: [LWarnDecls p]
• hs_annds :: [LAnnDecl p]
• hs_ruleds :: [LRuleDecls p]
• hs_docs :: [LDocDecl p]

XHsGroup !(XXHsGroup p)

data HsDerivingClause pass

A single deriving clause of a data declaration.

• AnnKeywordId : AnnDeriving, AnnStock, AnnAnyClass, AnnNewtype, AnnOpen,AnnClose

Constructors

HsDerivingClause

Fields

• deriv_clause_ext :: XCHsDerivingClause pass
• deriv_clause_strategy :: Maybe (LDerivStrategy pass)

  The user-specified strategy (if any) to use when deriving deriv_clause_tys.

• deriv_clause_tys :: LDerivClauseTys pass

  The types to derive.

XHsDerivingClause !(XXHsDerivingClause pass)

Instances

ToHie (Located (HsDerivingClause GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (HsDerivingClause GhcRn) -> HieM [HieAST Type]

ToHie (Located [Located (HsDerivingClause GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: Located [Located (HsDerivingClause GhcRn)] -> HieM [HieAST Type]

type Anno (HsDerivingClause (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (HsDerivingClause (GhcPass p)) = SrcSpan

type HsDeriving pass

Arguments

 = [LHsDerivingClause pass]

The optional deriving clauses of a data declaration. Clauses is plural because one can specify multiple deriving clauses using the -XDerivingStrategies language extension.

The list of LHsDerivingClauses corresponds to exactly what the user requested to derive, in order. If no deriving clauses were specified, the list is empty.

Haskell Deriving clause

data HsDecl p

A Haskell Declaration

Constructors

TyClD (XTyClD p) (TyClDecl p)

Type or Class Declaration

InstD (XInstD p) (InstDecl p)

Instance declaration

DerivD (XDerivD p) (DerivDecl p)

Deriving declaration

ValD (XValD p) (HsBind p)

Value declaration

SigD (XSigD p) (Sig p)

Signature declaration

KindSigD (XKindSigD p) (StandaloneKindSig p)

Standalone kind signature

DefD (XDefD p) (DefaultDecl p)

'default' declaration

ForD (XForD p) (ForeignDecl p)

Foreign declaration

WarningD (XWarningD p) (WarnDecls p)

Warning declaration

AnnD (XAnnD p) (AnnDecl p)

Annotation declaration

RuleD (XRuleD p) (RuleDecls p)

Rule declaration

SpliceD (XSpliceD p) (SpliceDecl p)

Splice declaration (Includes quasi-quotes)

DocD (XDocD p) DocDecl

Documentation comment declaration

RoleAnnotD (XRoleAnnotD p) (RoleAnnotDecl p)

Role annotation declaration

XHsDecl !(XXHsDecl p)

Instances

type Anno (HsDecl (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA

data HsDataDefn pass

Haskell Data type Definition

Constructors

HsDataDefn

Declares a data type or newtype, giving its constructors data/newtype T a = constrs data/newtype instance T [a] = constrs

Fields

• dd_ext :: XCHsDataDefn pass
• dd_ND :: NewOrData
• dd_ctxt :: Maybe (LHsContext pass)

  Context

• dd_cType :: Maybe (XRec pass CType)
• dd_kindSig :: Maybe (LHsKind pass)

  Optional kind signature.

  (Just k) for a GADT-style data, or data instance decl, with explicit kind sig

  Always Nothing for H98-syntax decls

• dd_cons :: [LConDecl pass]

  Data constructors

  For data T a = T1 | T2 a the LConDecls all have ConDeclH98. For data T a where { T1 :: T a } the LConDecls all have ConDeclGADT.

• dd_derivs :: HsDeriving pass

  Optional 'deriving' clause

XHsDataDefn !(XXHsDataDefn pass)

Instances

HasLoc (HsDataDefn GhcRn)

Defined in Compat.HieAst

Methods

loc :: HsDataDefn GhcRn -> SrcSpan

ToHie (HsDataDefn GhcRn)

Defined in Compat.HieAst

Methods

toHie :: HsDataDefn GhcRn -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (HsDataDefn GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (HsDataDefn GhcRn)) -> HieM [HieAST Type]

type HsConDeclH98Details pass = HsConDetails Void (HsScaled pass (LBangType pass)) (XRec pass [LConDeclField pass])

The arguments in a Haskell98-style data constructor.

data HsConDeclGADTDetails pass

The arguments in a GADT constructor. Unlike Haskell98-style constructors, GADT constructors cannot be declared with infix syntax. As a result, we do not use HsConDetails here, as InfixCon would be an unrepresentable state. (There is a notion of infix GADT constructors for the purposes of derived Show instances—see Note [Infix GADT constructors] in GHC.Tc.TyCl—but that is an orthogonal concern.)

Constructors

PrefixConGADT [HsScaled pass (LBangType pass)]

RecConGADT (XRec pass [LConDeclField pass])

Instances

ToHie (HsConDeclGADTDetails GhcRn)

Defined in Compat.HieAst

Methods

toHie :: HsConDeclGADTDetails GhcRn -> HieM [HieAST Type]

pattern XFunDep :: !(XXFunDep pass) -> FunDep pass

data ForeignImport

Constructors

CImport (Located CCallConv) (Located Safety) (Maybe Header) CImportSpec (Located SourceText)

Instances

Data ForeignImport

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ForeignImport -> c ForeignImport

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ForeignImport

toConstr :: ForeignImport -> Constr

dataTypeOf :: ForeignImport -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ForeignImport)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ForeignImport)

gmapT :: (forall b. Data b => b -> b) -> ForeignImport -> ForeignImport

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ForeignImport -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ForeignImport -> r

gmapQ :: (forall d. Data d => d -> u) -> ForeignImport -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ForeignImport -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

Outputable ForeignImport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignImport -> SDoc

ToHie ForeignImport

Defined in Compat.HieAst

Methods

toHie :: ForeignImport -> HieM [HieAST Type]

data ForeignExport

Constructors

CExport (Located CExportSpec) (Located SourceText)

Instances

Data ForeignExport

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ForeignExport -> c ForeignExport

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ForeignExport

toConstr :: ForeignExport -> Constr

dataTypeOf :: ForeignExport -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ForeignExport)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ForeignExport)

gmapT :: (forall b. Data b => b -> b) -> ForeignExport -> ForeignExport

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ForeignExport -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ForeignExport -> r

gmapQ :: (forall d. Data d => d -> u) -> ForeignExport -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ForeignExport -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

Outputable ForeignExport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignExport -> SDoc

ToHie ForeignExport

Defined in Compat.HieAst

Methods

toHie :: ForeignExport -> HieM [HieAST Type]

data ForeignDecl pass

Foreign Declaration

Constructors

ForeignImport

Fields

• fd_i_ext :: XForeignImport pass
• fd_name :: LIdP pass
• fd_sig_ty :: LHsSigType pass
• fd_fi :: ForeignImport

ForeignExport

• AnnKeywordId : AnnForeign, AnnImport,AnnExport, AnnDcolon

Fields

• fd_e_ext :: XForeignExport pass
• fd_name :: LIdP pass
• fd_sig_ty :: LHsSigType pass
• fd_fe :: ForeignExport

XForeignDecl !(XXForeignDecl pass)

Instances

ToHie (LocatedA (ForeignDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]

type Anno (ForeignDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA

data FamilyResultSig pass

type Family Result Signature

Constructors

NoSig (XNoSig pass)

• AnnKeywordId :

KindSig (XCKindSig pass) (LHsKind pass)

• AnnKeywordId : AnnOpenP,AnnDcolon, AnnCloseP

TyVarSig (XTyVarSig pass) (LHsTyVarBndr () pass)

• AnnKeywordId : AnnOpenP,AnnDcolon, AnnCloseP, AnnEqual

XFamilyResultSig !(XXFamilyResultSig pass)

Instances

ToHie (RScoped (Located (FamilyResultSig GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (Located (FamilyResultSig GhcRn)) -> HieM [HieAST Type]

type Anno (FamilyResultSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyResultSig (GhcPass p)) = SrcSpan

data FamilyInfo pass

Constructors

DataFamily

OpenTypeFamily

ClosedTypeFamily (Maybe [LTyFamInstEqn pass])

Nothing if we're in an hs-boot file and the user said "type family Foo x where .."

Instances

Outputable (FamilyInfo pass)

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: FamilyInfo pass -> SDoc

ToHie (FamilyInfo GhcRn)

Defined in Compat.HieAst

Methods

toHie :: FamilyInfo GhcRn -> HieM [HieAST Type]

data FamilyDecl pass

type Family Declaration

Constructors

FamilyDecl

Fields

• fdExt :: XCFamilyDecl pass
• fdInfo :: FamilyInfo pass
• fdTopLevel :: TopLevelFlag
• fdLName :: LIdP pass
• fdTyVars :: LHsQTyVars pass
• fdFixity :: LexicalFixity
• fdResultSig :: LFamilyResultSig pass
• fdInjectivityAnn :: Maybe (LInjectivityAnn pass)

XFamilyDecl !(XXFamilyDecl pass)

• AnnKeywordId : AnnType, AnnData, AnnFamily, AnnWhere, AnnOpenP, AnnDcolon, AnnCloseP, AnnEqual, AnnRarrow, AnnVbar

Instances

ToHie (LocatedA (FamilyDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]

type Anno (FamilyDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA

data FamEqn pass rhs

Family Equation

One equation in a type family instance declaration, data family instance declaration, or type family default. See Note [Type family instance declarations in HsSyn] See Note [Family instance declaration binders]

Constructors

FamEqn

Fields

• feqn_ext :: XCFamEqn pass rhs
• feqn_tycon :: LIdP pass
• feqn_bndrs :: HsOuterFamEqnTyVarBndrs pass

  Optional quantified type vars

• feqn_pats :: HsTyPats pass
• feqn_fixity :: LexicalFixity

  Fixity used in the declaration

• feqn_rhs :: rhs
  • AnnKeywordId : AnnEqual

XFamEqn !(XXFamEqn pass rhs)

Instances

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (HsDataDefn GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (HsDataDefn GhcRn)) -> HieM [HieAST Type]

(HasLoc a, HiePass p) => HasLoc (FamEqn (GhcPass p) a)

Defined in Compat.HieAst

Methods

loc :: FamEqn (GhcPass p) a -> SrcSpan

(ToHie rhs, HasLoc rhs) => ToHie (FamEqn GhcRn rhs)

Defined in Compat.HieAst

Methods

toHie :: FamEqn GhcRn rhs -> HieM [HieAST Type]

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

data DocDecl

Documentation comment Declaration

Constructors

DocCommentNext HsDocString

DocCommentPrev HsDocString

DocCommentNamed String HsDocString

DocGroup Int HsDocString

Instances

Data DocDecl

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DocDecl -> c DocDecl

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DocDecl

toConstr :: DocDecl -> Constr

dataTypeOf :: DocDecl -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DocDecl)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DocDecl)

gmapT :: (forall b. Data b => b -> b) -> DocDecl -> DocDecl

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DocDecl -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DocDecl -> r

gmapQ :: (forall d. Data d => d -> u) -> DocDecl -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DocDecl -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

Outputable DocDecl

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: DocDecl -> SDoc

type Anno DocDecl

Defined in GHC.Hs.Decls

type Anno DocDecl = SrcSpanAnnA

data DerivStrategy pass

Which technique the user explicitly requested when deriving an instance.

Constructors

StockStrategy (XStockStrategy pass)

GHC's "standard" strategy, which is to implement a custom instance for the data type. This only works for certain types that GHC knows about (e.g., Eq, Show, Functor when -XDeriveFunctor is enabled, etc.)

AnyclassStrategy (XAnyClassStrategy pass)

-XDeriveAnyClass

NewtypeStrategy (XNewtypeStrategy pass)

-XGeneralizedNewtypeDeriving

ViaStrategy (XViaStrategy pass)

-XDerivingVia

Instances

ToHie (Located (DerivStrategy GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (DerivStrategy GhcRn) -> HieM [HieAST Type]

type Anno (DerivStrategy (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivStrategy (GhcPass p)) = SrcSpan

data DerivDecl pass

Stand-alone 'deriving instance' declaration

Constructors

DerivDecl

Fields

• deriv_ext :: XCDerivDecl pass
• deriv_type :: LHsSigWcType pass

  The instance type to derive.

  It uses an LHsSigWcType because the context is allowed to be a single wildcard:

  deriving instance _ => Eq (Foo a)

  Which signifies that the context should be inferred.

• deriv_strategy :: Maybe (LDerivStrategy pass)
• deriv_overlap_mode :: Maybe (XRec pass OverlapMode)
  • AnnKeywordId : AnnDeriving, AnnInstance, AnnStock, AnnAnyClass, AnnNewtype, AnnOpen,AnnClose

XDerivDecl !(XXDerivDecl pass)

Instances

ToHie (LocatedA (DerivDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]

type Anno (DerivDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA

data DerivClauseTys pass

The types mentioned in a single deriving clause. This can come in two forms, DctSingle or DctMulti, depending on whether the types are surrounded by enclosing parentheses or not. These parentheses are semantically different than HsParTy. For example, deriving () means "derive zero classes" rather than "derive an instance of the 0-tuple".

DerivClauseTys use LHsSigType because deriving clauses can mention type variables that aren't bound by the datatype, e.g.

data T b = ... deriving (C [a])

should produce a derived instance for C [a] (T b).

Constructors

DctSingle (XDctSingle pass) (LHsSigType pass)

A deriving clause with a single type. Moreover, that type can only be a type constructor without any arguments.

Example: deriving Eq

DctMulti (XDctMulti pass) [LHsSigType pass]

A deriving clause with a comma-separated list of types, surrounded by enclosing parentheses.

Example: deriving (Eq, C a)

XDerivClauseTys !(XXDerivClauseTys pass)

Instances

ToHie (LocatedC (DerivClauseTys GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]

type Anno (DerivClauseTys (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC

data DefaultDecl pass

Default Declaration

Constructors

DefaultDecl (XCDefaultDecl pass) [LHsType pass]

• AnnKeywordIds : AnnDefault, AnnOpen,AnnClose

XDefaultDecl !(XXDefaultDecl pass)

Instances

ToHie (LocatedA (DefaultDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]

type Anno (DefaultDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DefaultDecl (GhcPass p)) = SrcSpanAnnA

newtype DataFamInstDecl pass

Data Family Instance Declaration

Constructors

DataFamInstDecl

• AnnKeywordId : AnnData, AnnNewType,AnnInstance, AnnDcolon AnnWhere,AnnOpen, AnnClose

Fields

• dfid_eqn :: FamEqn pass (HsDataDefn pass)

Instances

ToHie (LocatedA (DataFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]

type Anno (DataFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA

data DataDeclRn

Constructors

DataDeclRn

Fields

• tcdDataCusk :: Bool

  does this have a CUSK? See Note [CUSKs: complete user-supplied kind signatures]

• tcdFVs :: NameSet

Instances

Data DataDeclRn

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataDeclRn -> c DataDeclRn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataDeclRn

toConstr :: DataDeclRn -> Constr

dataTypeOf :: DataDeclRn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DataDeclRn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DataDeclRn)

gmapT :: (forall b. Data b => b -> b) -> DataDeclRn -> DataDeclRn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataDeclRn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataDeclRn -> r

gmapQ :: (forall d. Data d => d -> u) -> DataDeclRn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DataDeclRn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn

data ConDecl pass

data T b = forall a. Eq a => MkT a b
  MkT :: forall b a. Eq a => MkT a b

data T b where
     MkT1 :: Int -> T Int

data T = Int MkT Int
       | MkT2

data T a where
     Int MkT Int :: T Int

• AnnKeywordIds : AnnOpen, AnnDotdot,AnnCLose, AnnEqual,AnnVbar, AnnDarrow,AnnDarrow, AnnForall,AnnDot

data Constructor Declaration

Constructors

ConDeclGADT

Fields

• con_g_ext :: XConDeclGADT pass
• con_names :: [LIdP pass]
• con_bndrs :: XRec pass (HsOuterSigTyVarBndrs pass)

  The outermost type variable binders, be they explicit or implicit. The XRec is used to anchor exact print annotations, AnnForall and AnnDot.

• con_mb_cxt :: Maybe (LHsContext pass)

  User-written context (if any)

• con_g_args :: HsConDeclGADTDetails pass

  Arguments; never infix

• con_res_ty :: LHsType pass

  Result type

• con_doc :: Maybe LHsDocString

  A possible Haddock comment.

ConDeclH98

Fields

• con_ext :: XConDeclH98 pass
• con_name :: LIdP pass
• con_forall :: Bool

  True = explicit user-written forall e.g. data T a = forall b. MkT b (b->a) con_ex_tvs = {b} False => con_ex_tvs is empty

• con_ex_tvs :: [LHsTyVarBndr Specificity pass]

  Existentials only

• con_mb_cxt :: Maybe (LHsContext pass)

  User-written context (if any)

• con_args :: HsConDeclH98Details pass

  Arguments; can be infix

• con_doc :: Maybe LHsDocString

  A possible Haddock comment.

XConDecl !(XXConDecl pass)

Instances

ToHie (LocatedA (ConDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]

type Anno (ConDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA

data ClsInstDecl pass

Class Instance Declaration

Constructors

ClsInstDecl

Fields

• cid_ext :: XCClsInstDecl pass
• cid_poly_ty :: LHsSigType pass
• cid_binds :: LHsBinds pass
• cid_sigs :: [LSig pass]
• cid_tyfam_insts :: [LTyFamInstDecl pass]
• cid_datafam_insts :: [LDataFamInstDecl pass]
• cid_overlap_mode :: Maybe (XRec pass OverlapMode)
  • AnnKeywordId : AnnOpen, AnnClose,

XClsInstDecl !(XXClsInstDecl pass)

Instances

ToHie (LocatedA (ClsInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]

type Anno (ClsInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA

data CImportSpec

Constructors

CLabel CLabelString

CFunction CCallTarget

CWrapper

Instances

Data CImportSpec

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CImportSpec -> c CImportSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CImportSpec

toConstr :: CImportSpec -> Constr

dataTypeOf :: CImportSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CImportSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CImportSpec)

gmapT :: (forall b. Data b => b -> b) -> CImportSpec -> CImportSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CImportSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CImportSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> CImportSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CImportSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec

data AnnProvenance pass

Annotation Provenance

Constructors

ValueAnnProvenance (LIdP pass)

TypeAnnProvenance (LIdP pass)

ModuleAnnProvenance

Instances

ToHie (AnnProvenance GhcRn)

Defined in Compat.HieAst

Methods

toHie :: AnnProvenance GhcRn -> HieM [HieAST Type]

data AnnDecl pass

Annotation Declaration

Constructors

HsAnnotation (XHsAnnotation pass) SourceText (AnnProvenance pass) (XRec pass (HsExpr pass))

• AnnKeywordId : AnnOpen, AnnType AnnModule AnnClose

XAnnDecl !(XXAnnDecl pass)

Instances

ToHie (LocatedA (AnnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]

type Anno (AnnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA

tyClGroupTyClDecls :: [TyClGroup pass] -> [LTyClDecl pass]

tyClGroupRoleDecls :: [TyClGroup pass] -> [LRoleAnnotDecl pass]

tyClGroupKindSigs :: [TyClGroup pass] -> [LStandaloneKindSig pass]

tyClGroupInstDecls :: [TyClGroup pass] -> [LInstDecl pass]

tyClDeclTyVars :: TyClDecl pass -> LHsQTyVars pass

pprFullRuleName :: Located (SourceText, RuleName) -> SDoc

newOrDataToFlavour :: NewOrData -> TyConFlavour

Convert a NewOrData to a TyConFlavour

isTypeFamilyDecl :: TyClDecl pass -> Bool

type family declaration

isSynDecl :: TyClDecl pass -> Bool

type or type instance declaration

isOpenTypeFamilyInfo :: FamilyInfo pass -> Bool

open type family info

isFamilyDecl :: TyClDecl pass -> Bool

type/data family declaration

isDataFamilyDecl :: TyClDecl pass -> Bool

data family declaration

isDataDecl :: TyClDecl pass -> Bool

True = argument is a data/newtype declaration.

isClosedTypeFamilyInfo :: FamilyInfo pass -> Bool

closed type family info

isClassDecl :: TyClDecl pass -> Bool

type class

hsGroupInstDecls :: HsGroup id -> [LInstDecl id]

docDeclDoc :: DocDecl -> HsDocString

derivStrategyName :: DerivStrategy a -> SDoc

A short description of a DerivStrategy'.

countTyClDecls :: [TyClDecl pass] -> (Int, Int, Int, Int, Int)

collectRuleBndrSigTys :: [RuleBndr pass] -> [HsPatSigType pass]

annProvenanceName_maybe :: UnXRec p => AnnProvenance p -> Maybe (IdP p)

data SpliceExplicitFlag

Constructors

ExplicitSplice

= $(f x y)

ImplicitSplice

= f x y, i.e. a naked top level expression

Instances

Data SpliceExplicitFlag

Defined in GHC.Types.Basic

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SpliceExplicitFlag -> c SpliceExplicitFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SpliceExplicitFlag

toConstr :: SpliceExplicitFlag -> Constr

dataTypeOf :: SpliceExplicitFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SpliceExplicitFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SpliceExplicitFlag)

gmapT :: (forall b. Data b => b -> b) -> SpliceExplicitFlag -> SpliceExplicitFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SpliceExplicitFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SpliceExplicitFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> SpliceExplicitFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SpliceExplicitFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

module GHC.Hs.Expr

module GHC.Hs.Doc

module GHC.Hs.Extension

module GHC.Hs.ImpExp

module GHC.Hs.Pat

module GHC.Hs.Type

class UnXRec p => CollectPass p where

This class specifies how to collect variable identifiers from extension patterns in the given pass. Consumers of the GHC API that define their own passes should feel free to implement instances in order to make use of functions which depend on it.

In particular, Haddock already makes use of this, with an instance for its DocNameI pass so that it can reuse the code in GHC for collecting binders.

Methods

collectXXPat :: Proxy p -> CollectFlag p -> XXPat p -> [IdP p] -> [IdP p]

Instances

IsPass p => CollectPass (GhcPass p)

Defined in GHC.Hs.Utils

Methods

collectXXPat :: Proxy (GhcPass p) -> CollectFlag (GhcPass p) -> XXPat (GhcPass p) -> [IdP (GhcPass p)] -> [IdP (GhcPass p)]

data CollectFlag p where

Indicate if evidence binders have to be collected.

This type is used as a boolean (should we collect evidence binders or not?) but also to pass an evidence that the AST has been typechecked when we do want to collect evidence binders, otherwise these binders are not available.

See Note [Dictionary binders in ConPatOut]

Constructors

CollNoDictBinders :: forall p. CollectFlag p

Don't collect evidence binders

CollWithDictBinders :: CollectFlag (GhcPass 'Typechecked)

Collect evidence binders

unitRecStmtTc :: RecStmtTc

unguardedRHS :: forall (p :: Pass) body. Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpan => EpAnn GrhsAnn -> SrcSpan -> LocatedA (body (GhcPass p)) -> [LGRHS (GhcPass p) (LocatedA (body (GhcPass p)))]

unguardedGRHSs :: forall (p :: Pass) body. Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpan => SrcSpan -> LocatedA (body (GhcPass p)) -> EpAnn GrhsAnn -> GRHSs (GhcPass p) (LocatedA (body (GhcPass p)))

spanHsLocaLBinds :: forall (p :: Pass). Data (HsLocalBinds (GhcPass p)) => HsLocalBinds (GhcPass p) -> SrcSpan

Return the SrcSpan encompassing the contents of any enclosed binds

nl_HsVar :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> HsExpr (GhcPass p)

nlWildPatName :: LPat GhcRn

Wildcard pattern - after renaming

nlWildPat :: LPat GhcPs

Wildcard pattern - after parsing

nlWildConPat :: DataCon -> LPat GhcPs

nlVarPat :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LPat (GhcPass p)

nlTuplePat :: [LPat GhcPs] -> Boxity -> LPat GhcPs

nlParPat :: forall (name :: Pass). LPat (GhcPass name) -> LPat (GhcPass name)

nlNullaryConPat :: RdrName -> LPat GhcPs

nlLitPat :: HsLit GhcPs -> LPat GhcPs

nlList :: [LHsExpr GhcPs] -> LHsExpr GhcPs

nlInfixConPat :: RdrName -> LPat GhcPs -> LPat GhcPs -> LPat GhcPs

nlHsVarApps :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> [IdP (GhcPass p)] -> LHsExpr (GhcPass p)

nlHsVar :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LHsExpr (GhcPass p)

nlHsTyVar :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> LHsType (GhcPass p)

nlHsTyConApp :: forall (p :: Pass) a. IsSrcSpanAnn p a => LexicalFixity -> IdP (GhcPass p) -> [LHsTypeArg (GhcPass p)] -> LHsType (GhcPass p)

nlHsTyApps :: Id -> [Type] -> [LHsExpr GhcTc] -> LHsExpr GhcTc

nlHsTyApp :: Id -> [Type] -> LHsExpr GhcTc

nlHsSyntaxApps :: SyntaxExprTc -> [LHsExpr GhcTc] -> LHsExpr GhcTc

nlHsParTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p)

nlHsPar :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

nlHsOpApp :: LHsExpr GhcPs -> IdP GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs

nlHsLit :: forall (p :: Pass). HsLit (GhcPass p) -> LHsExpr (GhcPass p)

nlHsLam :: LMatch GhcPs (LHsExpr GhcPs) -> LHsExpr GhcPs

nlHsIntLit :: forall (p :: Pass). Integer -> LHsExpr (GhcPass p)

nlHsIf :: LHsExpr GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs

nlHsFunTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

nlHsDo :: HsStmtContext GhcRn -> [LStmt GhcPs (LHsExpr GhcPs)] -> LHsExpr GhcPs

nlHsDataCon :: DataCon -> LHsExpr GhcTc

NB: Only for LHsExpr Id.

nlHsCase :: LHsExpr GhcPs -> [LMatch GhcPs (LHsExpr GhcPs)] -> LHsExpr GhcPs

nlHsApps :: forall (p :: Pass) a. IsSrcSpanAnn p a => IdP (GhcPass p) -> [LHsExpr (GhcPass p)] -> LHsExpr (GhcPass p)

nlHsAppTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

nlHsAppKindTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsKind (GhcPass p) -> LHsType (GhcPass p)

nlHsApp :: forall (id :: Pass). IsPass id => LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

nlConVarPatName :: Name -> [Name] -> LPat GhcRn

nlConVarPat :: RdrName -> [RdrName] -> LPat GhcPs

nlConPatName :: Name -> [LPat GhcRn] -> LPat GhcRn

nlConPat :: RdrName -> [LPat GhcPs] -> LPat GhcPs

mkVarBind :: forall (p :: Pass). IdP (GhcPass p) -> LHsExpr (GhcPass p) -> LHsBind (GhcPass p)

mkUntypedSplice :: EpAnn [AddEpAnn] -> SpliceDecoration -> LHsExpr GhcPs -> HsSplice GhcPs

mkTypedSplice :: EpAnn [AddEpAnn] -> SpliceDecoration -> LHsExpr GhcPs -> HsSplice GhcPs

mkTransformStmt :: EpAnn [AddEpAnn] -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

mkTransformByStmt :: EpAnn [AddEpAnn] -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> LHsExpr GhcPs -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

mkTopFunBind :: Origin -> LocatedN Name -> [LMatch GhcRn (LHsExpr GhcRn)] -> HsBind GhcRn

In Name-land, with empty bind_fvs

mkTcBindStmt :: LPat GhcTc -> LocatedA (bodyR GhcTc) -> StmtLR GhcTc GhcTc (LocatedA (bodyR GhcTc))

mkSimpleMatch :: forall (p :: Pass) body. (Anno (Match (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpanAnnA, Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpan) => HsMatchContext (NoGhcTc (GhcPass p)) -> [LPat (GhcPass p)] -> LocatedA (body (GhcPass p)) -> LMatch (GhcPass p) (LocatedA (body (GhcPass p)))

mkSimpleGeneratedFunBind :: SrcSpan -> RdrName -> [LPat GhcPs] -> LHsExpr GhcPs -> LHsBind GhcPs

Convenience function using mkFunBind. This is for generated bindings only, do not use for user-written code.

mkRnBindStmt :: LPat GhcRn -> LocatedA (bodyR GhcRn) -> StmtLR GhcRn GhcRn (LocatedA (bodyR GhcRn))

mkRecStmt :: forall (idL :: Pass) bodyR. Anno [GenLocated (Anno (StmtLR (GhcPass idL) GhcPs bodyR)) (StmtLR (GhcPass idL) GhcPs bodyR)] ~ SrcSpanAnnL => EpAnn AnnList -> LocatedL [LStmtLR (GhcPass idL) GhcPs bodyR] -> StmtLR (GhcPass idL) GhcPs bodyR

mkPsBindStmt :: EpAnn [AddEpAnn] -> LPat GhcPs -> LocatedA (bodyR GhcPs) -> StmtLR GhcPs GhcPs (LocatedA (bodyR GhcPs))

mkPrefixFunRhs :: LIdP p -> HsMatchContext p

Make a prefix, non-strict function HsMatchContext

mkPatSynBind :: LocatedN RdrName -> HsPatSynDetails GhcPs -> LPat GhcPs -> HsPatSynDir GhcPs -> EpAnn [AddEpAnn] -> HsBind GhcPs

mkParPat :: forall (p :: Pass). IsPass p => LPat (GhcPass p) -> LPat (GhcPass p)

mkNPlusKPat :: LocatedN RdrName -> Located (HsOverLit GhcPs) -> EpAnn EpaLocation -> Pat GhcPs

mkNPat :: Located (HsOverLit GhcPs) -> Maybe (SyntaxExpr GhcPs) -> EpAnn [AddEpAnn] -> Pat GhcPs

mkMatchGroup :: forall (p :: Pass) body. AnnoBody p body => Origin -> LocatedL [LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p))))] -> MatchGroup (GhcPass p) (LocatedA (body (GhcPass p)))

mkMatch :: forall (p :: Pass). IsPass p => HsMatchContext (NoGhcTc (GhcPass p)) -> [LPat (GhcPass p)] -> LHsExpr (GhcPass p) -> HsLocalBinds (GhcPass p) -> LMatch (GhcPass p) (LHsExpr (GhcPass p))

mkLocatedList :: Semigroup a => [GenLocated (SrcAnn a) e2] -> LocatedAn an [GenLocated (SrcAnn a) e2]

mkLetStmt :: EpAnn [AddEpAnn] -> HsLocalBinds GhcPs -> StmtLR GhcPs GhcPs (LocatedA b)

mkLastStmt :: forall (idR :: Pass) bodyR (idL :: Pass). IsPass idR => LocatedA (bodyR (GhcPass idR)) -> StmtLR (GhcPass idL) (GhcPass idR) (LocatedA (bodyR (GhcPass idR)))

mkLHsWrapCo :: TcCoercionN -> LHsExpr GhcTc -> LHsExpr GhcTc

mkLHsWrap :: HsWrapper -> LHsExpr GhcTc -> LHsExpr GhcTc

mkLHsVarTuple :: forall (p :: Pass) a. IsSrcSpanAnn p a => [IdP (GhcPass p)] -> XExplicitTuple (GhcPass p) -> LHsExpr (GhcPass p)

mkLHsTupleExpr :: forall (p :: Pass). [LHsExpr (GhcPass p)] -> XExplicitTuple (GhcPass p) -> LHsExpr (GhcPass p)

mkLHsPar :: forall (id :: Pass). IsPass id => LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

Wrap in parens if hsExprNeedsParens appPrec says it needs them So f x becomes (f x), but 3 stays as 3.

mkLHsCmdWrap :: HsWrapper -> LHsCmd GhcTc -> LHsCmd GhcTc

mkHsWrapPatCo :: TcCoercionN -> Pat GhcTc -> Type -> Pat GhcTc

mkHsWrapPat :: HsWrapper -> Pat GhcTc -> Type -> Pat GhcTc

mkHsWrapCoR :: TcCoercionR -> HsExpr GhcTc -> HsExpr GhcTc

mkHsWrapCo :: TcCoercionN -> HsExpr GhcTc -> HsExpr GhcTc

mkHsWrap :: HsWrapper -> HsExpr GhcTc -> HsExpr GhcTc

Avoid HsWrap co1 (HsWrap co2 _) and HsWrap co1 (HsPar _ _) See Note [Detecting forced eta expansion] in GHC.HsToCore.Expr

mkHsVarBind :: SrcSpan -> RdrName -> LHsExpr GhcPs -> LHsBind GhcPs

mkHsStringPrimLit :: forall (p :: Pass). FastString -> HsLit (GhcPass p)

mkHsString :: forall (p :: Pass). String -> HsLit (GhcPass p)

mkHsSigEnv :: (LSig GhcRn -> Maybe ([LocatedN Name], a)) -> [LSig GhcRn] -> NameEnv a

mkHsQuasiQuote :: RdrName -> SrcSpan -> FastString -> HsSplice GhcPs

mkHsPar :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

e => (e)

mkHsOpApp :: LHsExpr GhcPs -> IdP GhcPs -> LHsExpr GhcPs -> HsExpr GhcPs

A useful function for building OpApps. The operator is always a variable, and we don't know the fixity yet.

mkHsLams :: [TyVar] -> [EvVar] -> LHsExpr GhcTc -> LHsExpr GhcTc

mkHsLam :: forall (p :: Pass). (IsPass p, XMG (GhcPass p) (LHsExpr (GhcPass p)) ~ NoExtField) => [LPat (GhcPass p)] -> LHsExpr (GhcPass p) -> LHsExpr (GhcPass p)

mkHsIsString :: SourceText -> FastString -> HsOverLit GhcPs

mkHsIntegral :: IntegralLit -> HsOverLit GhcPs

mkHsIf :: LHsExpr GhcPs -> LHsExpr GhcPs -> LHsExpr GhcPs -> EpAnn AnnsIf -> HsExpr GhcPs

mkHsFractional :: FractionalLit -> HsOverLit GhcPs

mkHsDoAnns :: HsStmtContext GhcRn -> LocatedL [ExprLStmt GhcPs] -> EpAnn AnnList -> HsExpr GhcPs

mkHsDo :: HsStmtContext GhcRn -> LocatedL [ExprLStmt GhcPs] -> HsExpr GhcPs

mkHsDictLet :: TcEvBinds -> LHsExpr GhcTc -> LHsExpr GhcTc

mkHsCompAnns :: HsStmtContext GhcRn -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> EpAnn AnnList -> HsExpr GhcPs

mkHsComp :: HsStmtContext GhcRn -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> HsExpr GhcPs

mkHsCmdWrap :: HsWrapper -> HsCmd GhcTc -> HsCmd GhcTc

mkHsCmdIf :: LHsExpr GhcPs -> LHsCmd GhcPs -> LHsCmd GhcPs -> EpAnn AnnsIf -> HsCmd GhcPs

mkHsCharPrimLit :: forall (p :: Pass). Char -> HsLit (GhcPass p)

mkHsCaseAlt :: forall (p :: Pass) body. (Anno (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpan, Anno (Match (GhcPass p) (LocatedA (body (GhcPass p)))) ~ SrcSpanAnnA) => LPat (GhcPass p) -> LocatedA (body (GhcPass p)) -> LMatch (GhcPass p) (LocatedA (body (GhcPass p)))

A simple case alternative with a single pattern, no binds, no guards; pre-typechecking

mkHsAppsWith :: forall (id :: Pass). (LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> HsExpr (GhcPass id) -> LHsExpr (GhcPass id)) -> LHsExpr (GhcPass id) -> [LHsExpr (GhcPass id)] -> LHsExpr (GhcPass id)

mkHsApps :: forall (id :: Pass). LHsExpr (GhcPass id) -> [LHsExpr (GhcPass id)] -> LHsExpr (GhcPass id)

mkHsAppWith :: forall (id :: Pass). (LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> HsExpr (GhcPass id) -> LHsExpr (GhcPass id)) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

mkHsAppTypes :: LHsExpr GhcRn -> [LHsWcType GhcRn] -> LHsExpr GhcRn

mkHsAppType :: LHsExpr GhcRn -> LHsWcType GhcRn -> LHsExpr GhcRn

mkHsApp :: forall (id :: Pass). LHsExpr (GhcPass id) -> LHsExpr (GhcPass id) -> LHsExpr (GhcPass id)

mkGroupUsingStmt :: EpAnn [AddEpAnn] -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

mkGroupByUsingStmt :: EpAnn [AddEpAnn] -> [ExprLStmt GhcPs] -> LHsExpr GhcPs -> LHsExpr GhcPs -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

mkFunBind :: Origin -> LocatedN RdrName -> [LMatch GhcPs (LHsExpr GhcPs)] -> HsBind GhcPs

Not infix, with place holders for coercion and free vars

mkClassOpSigs :: [LSig GhcPs] -> [LSig GhcPs]

Convert TypeSig to ClassOpSig. The former is what is parsed, but the latter is what we need in class/instance declarations

mkChunkified

Arguments

:: ([a] -> a)

"Small" constructor function, of maximum input arity mAX_TUPLE_SIZE

-> [a]

Possible "big" list of things to construct from

-> a

Constructed thing made possible by recursive decomposition

Lifts a "small" constructor into a "big" constructor by recursive decomposition

mkBodyStmt :: forall bodyR (idL :: Pass). LocatedA (bodyR GhcPs) -> StmtLR (GhcPass idL) GhcPs (LocatedA (bodyR GhcPs))

mkBigLHsVarTup :: forall (p :: Pass) a. IsSrcSpanAnn p a => [IdP (GhcPass p)] -> XExplicitTuple (GhcPass p) -> LHsExpr (GhcPass p)

The Big equivalents for the source tuple expressions

mkBigLHsVarPatTup :: [IdP GhcRn] -> LPat GhcRn

The Big equivalents for the source tuple patterns

mkBigLHsTup :: forall (id :: Pass). [LHsExpr (GhcPass id)] -> XExplicitTuple (GhcPass id) -> LHsExpr (GhcPass id)

mkBigLHsPatTup :: [LPat GhcRn] -> LPat GhcRn

missingTupArg :: EpAnn EpaLocation -> HsTupArg GhcPs

lStmtsImplicits :: forall (idR :: Pass) (body :: Type -> Type). [LStmtLR GhcRn (GhcPass idR) (LocatedA (body (GhcPass idR)))] -> [(SrcSpan, [Name])]

lPatImplicits :: LPat GhcRn -> [(SrcSpan, [Name])]

isUnliftedHsBind :: HsBind GhcTc -> Bool

Should we treat this as an unlifted bind? This will be true for any bind that binds an unlifted variable, but we must be careful around AbsBinds. See Note [Unlifted id check in isUnliftedHsBind]. For usage information, see Note [Strict binds checks] is GHC.HsToCore.Binds.

isInfixFunBind :: forall id1 id2. UnXRec id2 => HsBindLR id1 id2 -> Bool

If any of the matches in the FunBind are infix, the FunBind is considered infix.

isBangedHsBind :: HsBind GhcTc -> Bool

Is a binding a strict variable or pattern bind (e.g. !x = ...)?

hsValBindsImplicits :: forall (idR :: Pass). HsValBindsLR GhcRn (GhcPass idR) -> [(SrcSpan, [Name])]

hsTypeToHsSigWcType :: LHsType GhcPs -> LHsSigWcType GhcPs

Convert an LHsType to an LHsSigWcType.

hsTypeToHsSigType :: LHsType GhcPs -> LHsSigType GhcPs

Convert an LHsType to an LHsSigType.

hsTyClForeignBinders :: [TyClGroup GhcRn] -> [LForeignDecl GhcRn] -> [Name]

hsPatSynSelectors :: forall (p :: Pass). IsPass p => HsValBinds (GhcPass p) -> [FieldOcc (GhcPass p)]

Collects record pattern-synonym selectors only; the pattern synonym names are collected by collectHsValBinders.

hsLTyClDeclBinders :: forall (p :: Pass). IsPass p => LocatedA (TyClDecl (GhcPass p)) -> ([LocatedA (IdP (GhcPass p))], [LFieldOcc (GhcPass p)])

Returns all the binding names of the decl. The first one is guaranteed to be the name of the decl. The first component represents all binding names except record fields; the second represents field occurrences. For record fields mentioned in multiple constructors, the SrcLoc will be from the first occurrence.

Each returned (Located name) has a SrcSpan for the whole declaration. See Note [SrcSpan for binders]

hsGroupBinders :: HsGroup GhcRn -> [Name]

hsForeignDeclsBinders :: forall (p :: Pass) a. (UnXRec (GhcPass p), IsSrcSpanAnn p a) => [LForeignDecl (GhcPass p)] -> [LIdP (GhcPass p)]

See Note [SrcSpan for binders]

hsDataFamInstBinders :: forall (p :: Pass). IsPass p => DataFamInstDecl (GhcPass p) -> ([LocatedA (IdP (GhcPass p))], [LFieldOcc (GhcPass p)])

the SrcLoc returned are for the whole declarations, not just the names

getPatSynBinds :: UnXRec id => [(RecFlag, LHsBinds id)] -> [PatSynBind id id]

emptyTransStmt :: EpAnn [AddEpAnn] -> StmtLR GhcPs GhcPs (LHsExpr GhcPs)

emptyRecStmtName :: Anno [GenLocated (Anno (StmtLR GhcRn GhcRn bodyR)) (StmtLR GhcRn GhcRn bodyR)] ~ SrcSpanAnnL => StmtLR GhcRn GhcRn bodyR

emptyRecStmtId :: Stmt GhcTc (LocatedA (HsCmd GhcTc))

emptyRecStmt :: forall (idL :: Pass) bodyR. Anno [GenLocated (Anno (StmtLR (GhcPass idL) GhcPs bodyR)) (StmtLR (GhcPass idL) GhcPs bodyR)] ~ SrcSpanAnnL => StmtLR (GhcPass idL) GhcPs bodyR

collectStmtsBinders :: forall (idL :: Pass) (idR :: Pass) body. CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> [StmtLR (GhcPass idL) (GhcPass idR) body] -> [IdP (GhcPass idL)]

collectStmtBinders :: forall (idL :: Pass) (idR :: Pass) body. CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> StmtLR (GhcPass idL) (GhcPass idR) body -> [IdP (GhcPass idL)]

collectPatsBinders :: CollectPass p => CollectFlag p -> [LPat p] -> [IdP p]

collectPatBinders :: CollectPass p => CollectFlag p -> LPat p -> [IdP p]

collectMethodBinders :: UnXRec idL => LHsBindsLR idL idR -> [LIdP idL]

Used exclusively for the bindings of an instance decl which are all FunBinds

collectLocalBinders :: forall (idL :: Pass) (idR :: Pass). CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> HsLocalBindsLR (GhcPass idL) (GhcPass idR) -> [IdP (GhcPass idL)]

collectLStmtsBinders :: forall (idL :: Pass) (idR :: Pass) body. CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> [LStmtLR (GhcPass idL) (GhcPass idR) body] -> [IdP (GhcPass idL)]

collectLStmtBinders :: forall (idL :: Pass) (idR :: Pass) body. CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> LStmtLR (GhcPass idL) (GhcPass idR) body -> [IdP (GhcPass idL)]

collectHsValBinders :: forall (idL :: Pass) (idR :: Pass). CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> HsValBindsLR (GhcPass idL) (GhcPass idR) -> [IdP (GhcPass idL)]

collectHsIdBinders :: forall (idL :: Pass) (idR :: Pass). CollectPass (GhcPass idL) => CollectFlag (GhcPass idL) -> HsValBindsLR (GhcPass idL) (GhcPass idR) -> [IdP (GhcPass idL)]

Collect Id binders only, or Ids + pattern synonyms, respectively

collectHsBindListBinders :: CollectPass p => CollectFlag p -> [LHsBindLR p idR] -> [IdP p]

Same as collectHsBindsBinders, but works over a list of bindings

collectHsBindBinders :: CollectPass p => CollectFlag p -> HsBindLR p idR -> [IdP p]

Collect both Ids and pattern-synonym binders

chunkify :: [a] -> [[a]]

Split a list into lists that are small enough to have a corresponding tuple arity. The sub-lists of the result all have length <= mAX_TUPLE_SIZE But there may be more than mAX_TUPLE_SIZE sub-lists

mkHsAppTy :: forall (p :: Pass). LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

mkHsAppKindTy :: forall (p :: Pass). XAppKindTy (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p) -> LHsType (GhcPass p)

data UntypedSpliceFlavour

Constructors

UntypedExpSplice

UntypedPatSplice

UntypedTypeSplice

UntypedDeclSplice

Instances

Data UntypedSpliceFlavour

Defined in Language.Haskell.Syntax.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> UntypedSpliceFlavour -> c UntypedSpliceFlavour

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c UntypedSpliceFlavour

toConstr :: UntypedSpliceFlavour -> Constr

dataTypeOf :: UntypedSpliceFlavour -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c UntypedSpliceFlavour)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c UntypedSpliceFlavour)

gmapT :: (forall b. Data b => b -> b) -> UntypedSpliceFlavour -> UntypedSpliceFlavour

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> UntypedSpliceFlavour -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> UntypedSpliceFlavour -> r

gmapQ :: (forall d. Data d => d -> u) -> UntypedSpliceFlavour -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> UntypedSpliceFlavour -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> UntypedSpliceFlavour -> m UntypedSpliceFlavour

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> UntypedSpliceFlavour -> m UntypedSpliceFlavour

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> UntypedSpliceFlavour -> m UntypedSpliceFlavour

data TransForm

Constructors

ThenForm

GroupForm

Instances

Data TransForm

Defined in Language.Haskell.Syntax.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TransForm -> c TransForm

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TransForm

toConstr :: TransForm -> Constr

dataTypeOf :: TransForm -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TransForm)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TransForm)

gmapT :: (forall b. Data b => b -> b) -> TransForm -> TransForm

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TransForm -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TransForm -> r

gmapQ :: (forall d. Data d => d -> u) -> TransForm -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TransForm -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TransForm -> m TransForm

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TransForm -> m TransForm

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TransForm -> m TransForm

newtype ThModFinalizers

Finalizers produced by a splice with addModFinalizer

See Note [Delaying modFinalizers in untyped splices] in GHC.Rename.Splice. For how this is used.

Constructors

ThModFinalizers [ForeignRef (Q ())]

Instances

Data ThModFinalizers

Defined in Language.Haskell.Syntax.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ThModFinalizers -> c ThModFinalizers

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ThModFinalizers

toConstr :: ThModFinalizers -> Constr

dataTypeOf :: ThModFinalizers -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ThModFinalizers)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ThModFinalizers)

gmapT :: (forall b. Data b => b -> b) -> ThModFinalizers -> ThModFinalizers

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ThModFinalizers -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ThModFinalizers -> r

gmapQ :: (forall d. Data d => d -> u) -> ThModFinalizers -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ThModFinalizers -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ThModFinalizers -> m ThModFinalizers

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ThModFinalizers -> m ThModFinalizers

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ThModFinalizers -> m ThModFinalizers

data StmtLR idL idR body

Exact print annotations when in qualifier lists or guards - AnnKeywordId : AnnVbar, AnnComma,AnnThen, AnnBy,AnnBy, AnnGroup,AnnUsing

Constructors

LastStmt (XLastStmt idL idR body) body (Maybe Bool) (SyntaxExpr idR)

BindStmt

Fields

• (XBindStmt idL idR body)

  Post renaming has optional fail and bind / (>>=) operator. Post typechecking, also has multiplicity of the argument and the result type of the function passed to bind; that is, (P, S) in (>>=) :: Q -> (R # P -> S) -> T See Note [The type of bind in Stmts]

• (LPat idL)
• body

ApplicativeStmt (XApplicativeStmt idL idR body) [(SyntaxExpr idR, ApplicativeArg idL)] (Maybe (SyntaxExpr idR))

ApplicativeStmt represents an applicative expression built with <$> and <*>. It is generated by the renamer, and is desugared into the appropriate applicative expression by the desugarer, but it is intended to be invisible in error messages.

For full details, see Note [ApplicativeDo] in GHC.Rename.Expr

BodyStmt (XBodyStmt idL idR body) body (SyntaxExpr idR) (SyntaxExpr idR)

LetStmt (XLetStmt idL idR body) (HsLocalBindsLR idL idR)

• AnnKeywordId : AnnLet AnnOpen '{',AnnClose '}',

ParStmt (XParStmt idL idR body) [ParStmtBlock idL idR] (HsExpr idR) (SyntaxExpr idR)

TransStmt

Fields

• trS_ext :: XTransStmt idL idR body
• trS_form :: TransForm
• trS_stmts :: [ExprLStmt idL]
• trS_bndrs :: [(IdP idR, IdP idR)]
• trS_using :: LHsExpr idR
• trS_by :: Maybe (LHsExpr idR)
• trS_ret :: SyntaxExpr idR
• trS_bind :: SyntaxExpr idR
• trS_fmap :: HsExpr idR

RecStmt

• AnnKeywordId : AnnRec

Fields

• recS_ext :: XRecStmt idL idR body
• recS_stmts :: XRec idR [LStmtLR idL idR body]
• recS_later_ids :: [IdP idR]
• recS_rec_ids :: [IdP idR]
• recS_bind_fn :: SyntaxExpr idR
• recS_ret_fn :: SyntaxExpr idR
• recS_mfix_fn :: SyntaxExpr idR

XStmtLR !(XXStmtLR idL idR body)

Instances

(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.Types

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

type Stmt id body = StmtLR id id body

do block Statement

type SplicePointName = Name

data SpliceDecoration

A splice can appear with various decorations wrapped around it. This data type captures explicitly how it was originally written, for use in the pretty printer.

Constructors

DollarSplice

$splice or $$splice

BareSplice

bare splice

Instances

Data SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SpliceDecoration -> c SpliceDecoration

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SpliceDecoration

toConstr :: SpliceDecoration -> Constr

dataTypeOf :: SpliceDecoration -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SpliceDecoration)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SpliceDecoration)

gmapT :: (forall b. Data b => b -> b) -> SpliceDecoration -> SpliceDecoration

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SpliceDecoration -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SpliceDecoration -> r

gmapQ :: (forall d. Data d => d -> u) -> SpliceDecoration -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SpliceDecoration -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SpliceDecoration -> m SpliceDecoration

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceDecoration -> m SpliceDecoration

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceDecoration -> m SpliceDecoration

Show SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

Methods

showsPrec :: Int -> SpliceDecoration -> ShowS

show :: SpliceDecoration -> String

showList :: [SpliceDecoration] -> ShowS

Outputable SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: SpliceDecoration -> SDoc

Eq SpliceDecoration

Defined in Language.Haskell.Syntax.Expr

Methods

(==) :: SpliceDecoration -> SpliceDecoration -> Bool

(/=) :: SpliceDecoration -> SpliceDecoration -> Bool

type RecUpdProj p = RecProj p (LHsExpr p)

type RecProj p arg = HsRecField' (FieldLabelStrings p) arg

type family PendingTcSplice' p

Instances

type PendingTcSplice' (GhcPass _1)

Defined in GHC.Hs.Expr

type PendingTcSplice' (GhcPass _1) = PendingTcSplice

type family PendingRnSplice' p

Instances

type PendingRnSplice' (GhcPass _1)

Defined in GHC.Hs.Expr

type PendingRnSplice' (GhcPass _1) = PendingRnSplice

data ParStmtBlock idL idR

Parenthesised Statement Block

Constructors

ParStmtBlock (XParStmtBlock idL idR) [ExprLStmt idL] [IdP idR] (SyntaxExpr idR)

XParStmtBlock !(XXParStmtBlock idL idR)

data MatchGroupTc

Constructors

MatchGroupTc

Fields

• mg_arg_tys :: [Scaled Type]
• mg_res_ty :: Type

Instances

Data MatchGroupTc

Defined in Language.Haskell.Syntax.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> MatchGroupTc -> c MatchGroupTc

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c MatchGroupTc

toConstr :: MatchGroupTc -> Constr

dataTypeOf :: MatchGroupTc -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c MatchGroupTc)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c MatchGroupTc)

gmapT :: (forall b. Data b => b -> b) -> MatchGroupTc -> MatchGroupTc

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> MatchGroupTc -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> MatchGroupTc -> r

gmapQ :: (forall d. Data d => d -> u) -> MatchGroupTc -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> MatchGroupTc -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> MatchGroupTc -> m MatchGroupTc

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> MatchGroupTc -> m MatchGroupTc

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> MatchGroupTc -> m MatchGroupTc

data Match p body

Constructors

Match

Fields

• m_ext :: XCMatch p body
• m_ctxt :: HsMatchContext (NoGhcTc p)
• m_pats :: [LPat p]
• m_grhss :: GRHSs p body

XMatch !(XXMatch p body)

Instances

(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.PostProcess

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type LStmtLR idL idR body = XRec idL (StmtLR idL idR body)

Located Statement with separate Left and Right id's

type LStmt id body = XRec id (StmtLR id id body)

Located do block Statement

type LMatch id body = XRec id (Match id body)

Located Match

May have AnnKeywordId : AnnSemi when in a list

type LHsTupArg id = XRec id (HsTupArg id)

Located Haskell Tuple Argument

HsTupArg is used for tuple sections (,a,) is represented by ExplicitTuple [Missing ty1, Present a, Missing ty3] Which in turn stands for (x:ty1 y:ty2. (x,a,y))

type LHsRecUpdProj p = XRec p (RecUpdProj p)

type LHsRecProj p arg = XRec p (RecProj p arg)

type LHsCmdTop p = XRec p (HsCmdTop p)

Top-level command, introducing a new arrow. This may occur inside a proc (where the stack is empty) or as an argument of a command-forming operator.

Located Haskell Top-level Command

type LHsCmd id = XRec id (HsCmd id)

Located Haskell Command (for arrow syntax)

type LGRHS id body = XRec id (GRHS id body)

Located Guarded Right-Hand Side

data HsTupArg id

• AnnKeywordId : AnnComma

Haskell Tuple Argument

Constructors

Present (XPresent id) (LHsExpr id)

The argument

Missing (XMissing id)

The argument is missing, but this is its type

XTupArg !(XXTupArg id)

Note [Trees that Grow] extension point

Instances

HiePass p => ToHie (HsTupArg (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: HsTupArg (GhcPass p) -> HieM [HieAST Type]

data HsStmtContext p

Haskell Statement Context.

Constructors

ListComp

MonadComp

DoExpr (Maybe ModuleName)

ModuleName.

do { ... }

MDoExpr (Maybe ModuleName)

ModuleName.

mdo { ... } ie recursive do-expression

ArrowExpr

do-notation in an arrow-command context

GhciStmtCtxt

A command-line Stmt in GHCi pat <- rhs

PatGuard (HsMatchContext p)

Pattern guard for specified thing

ParStmtCtxt (HsStmtContext p)

A branch of a parallel stmt

TransStmtCtxt (HsStmtContext p)

A branch of a transform stmt

Instances

HiePass p => ToHie (HsStmtContext (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: HsStmtContext (GhcPass p) -> HieM [HieAST Type]

data HsSplicedThing id

Haskell Spliced Thing

Values that can result from running a splice.

Constructors

HsSplicedExpr (HsExpr id)

Haskell Spliced Expression

HsSplicedTy (HsType id)

Haskell Spliced Type

HsSplicedPat (Pat id)

Haskell Spliced Pattern

type HsRecordBinds p = HsRecFields p (LHsExpr p)

Haskell Record Bindings

data HsPragE p

A pragma, written as {-# ... #-}, that may appear within an expression.

Constructors

HsPragSCC (XSCC p) SourceText StringLiteral

XHsPragE !(XXPragE p)

• AnnKeywordId : AnnOpen, AnnOpen '{-# GENERATED', AnnVal,AnnVal, AnnColon,AnnVal, AnnMinus, AnnVal,AnnColon, AnnVal, AnnClose '#-}'

data HsMatchContext p

Haskell Match Context

Context of a pattern match. This is more subtle than it would seem. See Note [Varieties of pattern matches].

Constructors

FunRhs

Fields

• mc_fun :: LIdP p

  function binder of f

• mc_fixity :: LexicalFixity

  fixing of f

• mc_strictness :: SrcStrictness

  was f banged? See Note [FunBind vs PatBind]

LambdaExpr

Patterns of a lambda

CaseAlt

Patterns and guards on a case alternative

IfAlt

Guards of a multi-way if alternative

ArrowMatchCtxt HsArrowMatchContext

A pattern match inside arrow notation

PatBindRhs

A pattern binding eg [y] <- e = e

PatBindGuards

Guards of pattern bindings, e.g., (Just b) | Just _ <- x = e | otherwise = e'

RecUpd

Record update [used only in GHC.HsToCore.Expr to tell matchWrapper what sort of runtime error message to generate]

StmtCtxt (HsStmtContext p)

Pattern of a do-stmt, list comprehension, pattern guard, etc

ThPatSplice

A Template Haskell pattern splice

ThPatQuote

A Template Haskell pattern quotation [p| (a,b) |]

PatSyn

A pattern synonym declaration

Instances

HiePass p => ToHie (HsMatchContext (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: HsMatchContext (GhcPass p) -> HieM [HieAST Type]

data HsFieldLabel p

Constructors

HsFieldLabel

Fields

• hflExt :: XCHsFieldLabel p
• hflLabel :: Located FieldLabelString

XHsFieldLabel !(XXHsFieldLabel p)

Instances

Outputable (HsFieldLabel p)

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: HsFieldLabel p -> SDoc

type family HsDoRn p

The AST used to hard-refer to GhcPass, which was a layer violation. For now, we paper it over with this new extension point.

Instances

type HsDoRn (GhcPass _1)

Defined in GHC.Hs.Expr

type HsDoRn (GhcPass _1) = GhcRn

data HsCmdTop p

Haskell Top-level Command

Constructors

HsCmdTop (XCmdTop p) (LHsCmd p)

XCmdTop !(XXCmdTop p)

Instances

HiePass p => ToHie (Located (HsCmdTop (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: Located (HsCmdTop (GhcPass p)) -> HieM [HieAST Type]

type Anno (HsCmdTop (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmdTop (GhcPass p)) = SrcSpan

data HsCmd id

Haskell Command (e.g. a "statement" in an Arrow proc block)

Constructors

HsCmdArrApp (XCmdArrApp id) (LHsExpr id) (LHsExpr id) HsArrAppType Bool

• AnnKeywordId : Annlarrowtail, Annrarrowtail,AnnLarrowtail, AnnRarrowtail

HsCmdArrForm (XCmdArrForm id) (LHsExpr id) LexicalFixity (Maybe Fixity) [LHsCmdTop id]

• AnnKeywordId : AnnOpenB '(|', AnnCloseB '|)'

HsCmdApp (XCmdApp id) (LHsCmd id) (LHsExpr id)

HsCmdLam (XCmdLam id) (MatchGroup id (LHsCmd id))

• AnnKeywordId : AnnLam, AnnRarrow,

HsCmdPar (XCmdPar id) (LHsCmd id)

• AnnKeywordId : AnnOpen '(', AnnClose ')'

HsCmdCase (XCmdCase id) (LHsExpr id) (MatchGroup id (LHsCmd id))

• AnnKeywordId : AnnCase, AnnOf,AnnOpen '{', AnnClose '}'

HsCmdLamCase (XCmdLamCase id) (MatchGroup id (LHsCmd id))

• AnnKeywordId : AnnLam, AnnCase,AnnOpen '{', AnnClose '}'

HsCmdIf (XCmdIf id) (SyntaxExpr id) (LHsExpr id) (LHsCmd id) (LHsCmd id)

• AnnKeywordId : AnnIf, AnnSemi, AnnThen,AnnSemi, AnnElse,

HsCmdLet (XCmdLet id) (HsLocalBinds id) (LHsCmd id)

• AnnKeywordId : AnnLet, AnnOpen '{', AnnClose '}',AnnIn

HsCmdDo (XCmdDo id) (XRec id [CmdLStmt id])

• AnnKeywordId : AnnDo, AnnOpen, AnnSemi, AnnVbar, AnnClose

XCmd !(XXCmd id)

Instances

DisambECP (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

Associated Types

type Body (HsCmd GhcPs) :: Type -> Type

type InfixOp (HsCmd GhcPs)

type FunArg (HsCmd GhcPs)

Methods

ecpFromCmd' :: LHsCmd GhcPs -> PV (LocatedA (HsCmd GhcPs))

ecpFromExp' :: LHsExpr GhcPs -> PV (LocatedA (HsCmd GhcPs))

mkHsProjUpdatePV :: SrcSpan -> Located [Located (HsFieldLabel GhcPs)] -> LocatedA (HsCmd GhcPs) -> Bool -> [AddEpAnn] -> PV (LHsRecProj GhcPs (LocatedA (HsCmd GhcPs)))

mkHsLamPV :: SrcSpan -> (EpAnnComments -> MatchGroup GhcPs (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs))

mkHsLetPV :: SrcSpan -> HsLocalBinds GhcPs -> LocatedA (HsCmd GhcPs) -> AnnsLet -> PV (LocatedA (HsCmd GhcPs))

superInfixOp :: (DisambInfixOp (InfixOp (HsCmd GhcPs)) => PV (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs))

mkHsOpAppPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> LocatedN (InfixOp (HsCmd GhcPs)) -> LocatedA (HsCmd GhcPs) -> PV (LocatedA (HsCmd GhcPs))

mkHsCasePV :: SrcSpan -> LHsExpr GhcPs -> LocatedL [LMatch GhcPs (LocatedA (HsCmd GhcPs))] -> EpAnnHsCase -> PV (LocatedA (HsCmd GhcPs))

mkHsLamCasePV :: SrcSpan -> LocatedL [LMatch GhcPs (LocatedA (HsCmd GhcPs))] -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

superFunArg :: (DisambECP (FunArg (HsCmd GhcPs)) => PV (LocatedA (HsCmd GhcPs))) -> PV (LocatedA (HsCmd GhcPs))

mkHsAppPV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> LocatedA (FunArg (HsCmd GhcPs)) -> PV (LocatedA (HsCmd GhcPs))

mkHsAppTypePV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> SrcSpan -> LHsType GhcPs -> PV (LocatedA (HsCmd GhcPs))

mkHsIfPV :: SrcSpan -> LHsExpr GhcPs -> Bool -> LocatedA (HsCmd GhcPs) -> Bool -> LocatedA (HsCmd GhcPs) -> AnnsIf -> PV (LocatedA (HsCmd GhcPs))

mkHsDoPV :: SrcSpan -> Maybe ModuleName -> LocatedL [LStmt GhcPs (LocatedA (HsCmd GhcPs))] -> AnnList -> PV (LocatedA (HsCmd GhcPs))

mkHsParPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> AnnParen -> PV (LocatedA (HsCmd GhcPs))

mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsCmd GhcPs))

mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsCmd GhcPs))

mkHsOverLitPV :: Located (HsOverLit GhcPs) -> PV (Located (HsCmd GhcPs))

mkHsWildCardPV :: SrcSpan -> PV (Located (HsCmd GhcPs))

mkHsTySigPV :: SrcSpanAnnA -> LocatedA (HsCmd GhcPs) -> LHsType GhcPs -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

mkHsExplicitListPV :: SrcSpan -> [LocatedA (HsCmd GhcPs)] -> AnnList -> PV (LocatedA (HsCmd GhcPs))

mkHsSplicePV :: Located (HsSplice GhcPs) -> PV (Located (HsCmd GhcPs))

mkHsRecordPV :: Bool -> SrcSpan -> SrcSpan -> LocatedA (HsCmd GhcPs) -> ([Fbind (HsCmd GhcPs)], Maybe SrcSpan) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

mkHsNegAppPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

mkHsSectionR_PV :: SrcSpan -> LocatedA (InfixOp (HsCmd GhcPs)) -> LocatedA (HsCmd GhcPs) -> PV (Located (HsCmd GhcPs))

mkHsViewPatPV :: SrcSpan -> LHsExpr GhcPs -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

mkHsAsPatPV :: SrcSpan -> LocatedN RdrName -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

mkHsLazyPatPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

mkHsBangPatPV :: SrcSpan -> LocatedA (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

mkSumOrTuplePV :: SrcSpanAnnA -> Boxity -> SumOrTuple (HsCmd GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsCmd GhcPs))

rejectPragmaPV :: LocatedA (HsCmd GhcPs) -> PV ()

HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]

type Body (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

type Body (HsCmd GhcPs) = HsCmd

type FunArg (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

type FunArg (HsCmd GhcPs) = HsExpr GhcPs

type InfixOp (HsCmd GhcPs)

Defined in GHC.Parser.PostProcess

type InfixOp (HsCmd GhcPs) = HsExpr GhcPs

type Anno (HsCmd (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmd (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type family HsBracketRn p

Instances

type HsBracketRn (GhcPass _1)

Defined in GHC.Hs.Expr

type HsBracketRn (GhcPass _1) = GhcRn

data HsBracket p

Haskell Bracket

Constructors

ExpBr (XExpBr p) (LHsExpr p)

PatBr (XPatBr p) (LPat p)

DecBrL (XDecBrL p) [LHsDecl p]

DecBrG (XDecBrG p) (HsGroup p)

TypBr (XTypBr p) (LHsType p)

VarBr (XVarBr p) Bool (LIdP p)

TExpBr (XTExpBr p) (LHsExpr p)

XBracket !(XXBracket p)

Instances

ToHie (HsBracket a)

Defined in Compat.HieAst

Methods

toHie :: HsBracket a -> HieM [HieAST Type]

data HsArrowMatchContext

Haskell arrow match context.

Constructors

ProcExpr

A proc expression

ArrowCaseAlt

A case alternative inside arrow notation

KappaExpr

An arrow kappa abstraction

data HsArrAppType

Haskell Array Application Type

Constructors

HsHigherOrderApp

HsFirstOrderApp

Instances

Data HsArrAppType

Defined in Language.Haskell.Syntax.Expr

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsArrAppType -> c HsArrAppType

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsArrAppType

toConstr :: HsArrAppType -> Constr

dataTypeOf :: HsArrAppType -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsArrAppType)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsArrAppType)

gmapT :: (forall b. Data b => b -> b) -> HsArrAppType -> HsArrAppType

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsArrAppType -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsArrAppType -> r

gmapQ :: (forall d. Data d => d -> u) -> HsArrAppType -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsArrAppType -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsArrAppType -> m HsArrAppType

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsArrAppType -> m HsArrAppType

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsArrAppType -> m HsArrAppType

type GuardStmt id = Stmt id (LHsExpr id)

Guard Statement

type GuardLStmt id = LStmt id (LHsExpr id)

Guard Located Statement

type GhciStmt id = Stmt id (LHsExpr id)

Ghci Statement

type GhciLStmt id = LStmt id (LHsExpr id)

Ghci Located Statement

data GRHS p body

Guarded Right Hand Side.

Constructors

GRHS (XCGRHS p body) [GuardLStmt p] body

XGRHS !(XXGRHS p body)

Instances

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

newtype FieldLabelStrings p

RecordDotSyntax field updates

Constructors

FieldLabelStrings [Located (HsFieldLabel p)]

Instances

Outputable (FieldLabelStrings p)

Defined in Language.Haskell.Syntax.Expr

Methods

ppr :: FieldLabelStrings p -> SDoc

OutputableBndr (FieldLabelStrings p)

Defined in Language.Haskell.Syntax.Expr

Methods

pprBndr :: BindingSite -> FieldLabelStrings p -> SDoc

pprPrefixOcc :: FieldLabelStrings p -> SDoc

pprInfixOcc :: FieldLabelStrings p -> SDoc

bndrIsJoin_maybe :: FieldLabelStrings p -> Maybe Int

type FailOperator id = Maybe (SyntaxExpr id)

The fail operator

This is used for `.. <-` "bind statements" in do notation, including non-monadic "binds" in applicative.

The fail operator is 'Just expr' if it potentially fail monadically. if the pattern match cannot fail, or shouldn't fail monadically (regular incomplete pattern exception), it is Nothing.

See Note [Monad fail : Rebindable syntax, overloaded strings] for the type of expression in the Just case, and why it is so.

See Note [Failing pattern matches in Stmts] for which contexts for 'BindStmt's should use the monadic fail and which shouldn't.

type ExprStmt id = Stmt id (LHsExpr id)

Expression Statement

type ExprLStmt id = LStmt id (LHsExpr id)

Expression Located Statement

type CmdSyntaxTable p = [(Name, HsExpr p)]

Command Syntax Table (for Arrow syntax)

type CmdStmt id = Stmt id (LHsCmd id)

Command Statement

type CmdLStmt id = LStmt id (LHsCmd id)

Command Located Statement

data ArithSeqInfo id

Arithmetic Sequence Information

Constructors

From (LHsExpr id)

FromThen (LHsExpr id) (LHsExpr id)

FromTo (LHsExpr id) (LHsExpr id)

FromThenTo (LHsExpr id) (LHsExpr id) (LHsExpr id)

Instances

ToHie (LHsExpr a) => ToHie (ArithSeqInfo a)

Defined in Compat.HieAst

Methods

toHie :: ArithSeqInfo a -> HieM [HieAST Type]

type family ApplicativeArgStmCtxPass idL

Instances

type ApplicativeArgStmCtxPass _1

Defined in GHC.Hs.Expr

type ApplicativeArgStmCtxPass _1 = GhcRn

data ApplicativeArg idL

Applicative Argument

Constructors

ApplicativeArgOne

Fields

• xarg_app_arg_one :: XApplicativeArgOne idL

  The fail operator, after renaming

  The fail operator is needed if this is a BindStmt where the pattern can fail. E.g.: (Just a) <- stmt The fail operator will be invoked if the pattern match fails. It is also used for guards in MonadComprehensions. The fail operator is Nothing if the pattern match can't fail

• app_arg_pattern :: LPat idL
• arg_expr :: LHsExpr idL
• is_body_stmt :: Bool

  True = was a BodyStmt, False = was a BindStmt. See Note [Applicative BodyStmt]

ApplicativeArgMany

Fields

• xarg_app_arg_many :: XApplicativeArgMany idL
• app_stmts :: [ExprLStmt idL]
• final_expr :: HsExpr idL
• bv_pattern :: LPat idL
• stmt_context :: HsStmtContext (ApplicativeArgStmCtxPass idL)

  context of the do expression, used in pprArg

XApplicativeArg !(XXApplicativeArg idL)

Instances

HiePass p => ToHie (RScoped (ApplicativeArg (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (ApplicativeArg (GhcPass p)) -> HieM [HieAST Type]

qualifiedDoModuleName_maybe :: HsStmtContext p -> Maybe ModuleName

prependQualified :: Maybe ModuleName -> SDoc -> SDoc

pprStmtContext :: (Outputable (IdP p), UnXRec p) => HsStmtContext p -> SDoc

pprMatchContextNoun :: (Outputable (IdP p), UnXRec p) => HsMatchContext p -> SDoc

pprMatchContext :: (Outputable (IdP p), UnXRec p) => HsMatchContext p -> SDoc

pprFieldLabelStrings :: FieldLabelStrings p -> SDoc

pprExternalSrcLoc :: (StringLiteral, (Int, Int), (Int, Int)) -> SDoc

pprArrowMatchContextNoun :: HsArrowMatchContext -> SDoc

pprAStmtContext :: (Outputable (IdP p), UnXRec p) => HsStmtContext p -> SDoc

matchSeparator :: HsMatchContext p -> SDoc

isTypedSplice :: HsSplice id -> Bool

isTypedBracket :: HsBracket id -> Bool

isPatSynCtxt :: HsMatchContext p -> Bool

isMonadStmtContext :: HsStmtContext id -> Bool

Is this a monadic context?

isMonadCompContext :: HsStmtContext id -> Bool

isInfixMatch :: Match id body -> Bool

isComprehensionContext :: HsStmtContext id -> Bool

data WarnDecls pass

Warning pragma Declarations

Constructors

Warnings

Fields

• wd_ext :: XWarnings pass
• wd_src :: SourceText
• wd_warnings :: [LWarnDecl pass]

XWarnDecls !(XXWarnDecls pass)

Instances

ToHie (LocatedA (WarnDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]

type Anno (WarnDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA

data WarnDecl pass

Warning pragma Declaration

Constructors

Warning (XWarning pass) [LIdP pass] WarningTxt

XWarnDecl !(XXWarnDecl pass)

Instances

ToHie (LocatedA (WarnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]

type Anno (WarnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA

type TyFamInstEqn pass = FamEqn pass (LHsType pass)

Type Family Instance Equation

data TyFamInstDecl pass

Type Family Instance Declaration

Constructors

TyFamInstDecl

• AnnKeywordId : AnnType, AnnInstance,

Fields

• tfid_xtn :: XCTyFamInstDecl pass
• tfid_eqn :: TyFamInstEqn pass

XTyFamInstDecl !(XXTyFamInstDecl pass)

Instances

ToHie (LocatedA (TyFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]

type Anno (TyFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA

type TyFamDefltDecl = TyFamInstDecl

Type family default declarations. A convenient synonym for TyFamInstDecl. See Note [Type family instance declarations in HsSyn].

data TyClGroup pass

Type or Class Group

Constructors

TyClGroup

Fields

• group_ext :: XCTyClGroup pass
• group_tyclds :: [LTyClDecl pass]
• group_roles :: [LRoleAnnotDecl pass]
• group_kisigs :: [LStandaloneKindSig pass]
• group_instds :: [LInstDecl pass]

XTyClGroup !(XXTyClGroup pass)

Instances

ToHie (TyClGroup GhcRn)

Defined in Compat.HieAst

Methods

toHie :: TyClGroup GhcRn -> HieM [HieAST Type]

data TyClDecl pass

A type or class declaration.

Constructors

FamDecl

type/data family T :: *->*

• AnnKeywordId : AnnType, AnnData, AnnFamily,AnnDcolon, AnnWhere,AnnOpenP, AnnDcolon,AnnCloseP, AnnEqual,AnnRarrow, AnnVbar

Fields

• tcdFExt :: XFamDecl pass
• tcdFam :: FamilyDecl pass

SynDecl

type declaration

• AnnKeywordId : AnnType, AnnEqual,

Fields

• tcdSExt :: XSynDecl pass

  Post renameer, FVs

• tcdLName :: LIdP pass

  Type constructor

• tcdTyVars :: LHsQTyVars pass

  Type variables; for an associated type these include outer binders

• tcdFixity :: LexicalFixity

  Fixity used in the declaration

• tcdRhs :: LHsType pass

  RHS of type declaration

DataDecl

data declaration

• AnnKeywordId : AnnData, AnnFamily, AnnNewType, AnnNewType,AnnDcolon AnnWhere,

Fields

• tcdDExt :: XDataDecl pass

  Post renamer, CUSK flag, FVs

• tcdLName :: LIdP pass

  Type constructor

• tcdTyVars :: LHsQTyVars pass

  Type variables; for an associated type these include outer binders

• tcdFixity :: LexicalFixity

  Fixity used in the declaration

• tcdDataDefn :: HsDataDefn pass

ClassDecl

Fields

• tcdCExt :: XClassDecl pass

  Post renamer, FVs

• tcdCtxt :: Maybe (LHsContext pass)

  Context...

• tcdLName :: LIdP pass

  Type constructor

• tcdTyVars :: LHsQTyVars pass

  Type variables; for an associated type these include outer binders

• tcdFixity :: LexicalFixity

  Fixity used in the declaration

• tcdFDs :: [LHsFunDep pass]

  Functional deps

• tcdSigs :: [LSig pass]

  Methods' signatures

• tcdMeths :: LHsBinds pass

  Default methods

• tcdATs :: [LFamilyDecl pass]

  Associated types;

• tcdATDefs :: [LTyFamDefltDecl pass]

  Associated type defaults

• tcdDocs :: [LDocDecl pass]

  Haddock docs

XTyClDecl !(XXTyClDecl pass)

Instances

ToHie (LocatedA (TyClDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]

type Anno (TyClDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA

data StandaloneKindSig pass

Constructors

StandaloneKindSig (XStandaloneKindSig pass) (LIdP pass) (LHsSigType pass)

XStandaloneKindSig !(XXStandaloneKindSig pass)

Instances

ToHie (LocatedA (StandaloneKindSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]

ToHie (StandaloneKindSig GhcRn)

Defined in Compat.HieAst

Methods

toHie :: StandaloneKindSig GhcRn -> HieM [HieAST Type]

type Anno (StandaloneKindSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA

data SpliceDecl p

Splice Declaration

Constructors

SpliceDecl (XSpliceDecl p) (XRec p (HsSplice p)) SpliceExplicitFlag

XSpliceDecl !(XXSpliceDecl p)

Instances

ToHie (LocatedA (SpliceDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]

type Anno (SpliceDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA

data RuleDecls pass

Rule Declarations

Constructors

HsRules

Fields

• rds_ext :: XCRuleDecls pass
• rds_src :: SourceText
• rds_rules :: [LRuleDecl pass]

XRuleDecls !(XXRuleDecls pass)

Instances

ToHie (LocatedA (RuleDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]

type Anno (RuleDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA

data RuleDecl pass

Rule Declaration

Constructors

HsRule

Fields

• rd_ext :: XHsRule pass

  After renamer, free-vars from the LHS and RHS

• rd_name :: XRec pass (SourceText, RuleName)

  Note [Pragma source text] in GHC.Types.Basic

• rd_act :: Activation
• rd_tyvs :: Maybe [LHsTyVarBndr () (NoGhcTc pass)]

  Forall'd type vars

• rd_tmvs :: [LRuleBndr pass]

  Forall'd term vars, before typechecking; after typechecking this includes all forall'd vars

• rd_lhs :: XRec pass (HsExpr pass)
• rd_rhs :: XRec pass (HsExpr pass)
  • AnnKeywordId : AnnOpen,AnnTilde, AnnVal, AnnClose, AnnForall,AnnDot, AnnEqual,

XRuleDecl !(XXRuleDecl pass)

Instances

ToHie (LocatedA (RuleDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]

type Anno (RuleDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA

data RuleBndr pass

Rule Binder

Constructors

RuleBndr (XCRuleBndr pass) (LIdP pass)

RuleBndrSig (XRuleBndrSig pass) (LIdP pass) (HsPatSigType pass)

XRuleBndr !(XXRuleBndr pass)

• AnnKeywordId : AnnOpen, AnnDcolon,AnnClose

Instances

ToHie (RScoped (Located (RuleBndr GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (Located (RuleBndr GhcRn)) -> HieM [HieAST Type]

type Anno (RuleBndr (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleBndr (GhcPass p)) = SrcSpan

data RoleAnnotDecl pass

Role Annotation Declaration

Constructors

RoleAnnotDecl (XCRoleAnnotDecl pass) (LIdP pass) [XRec pass (Maybe Role)]

• AnnKeywordId : AnnType, AnnRole

XRoleAnnotDecl !(XXRoleAnnotDecl pass)

Instances

ToHie (LocatedA (RoleAnnotDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]

type Anno (RoleAnnotDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA

data NewOrData

Constructors

NewType

newtype Blah ...

DataType

data Blah ...

Instances

Data NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NewOrData -> c NewOrData

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NewOrData

toConstr :: NewOrData -> Constr

dataTypeOf :: NewOrData -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NewOrData)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NewOrData)

gmapT :: (forall b. Data b => b -> b) -> NewOrData -> NewOrData

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NewOrData -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NewOrData -> r

gmapQ :: (forall d. Data d => d -> u) -> NewOrData -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NewOrData -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NewOrData -> m NewOrData

Outputable NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: NewOrData -> SDoc

Eq NewOrData

Defined in Language.Haskell.Syntax.Decls

Methods

(==) :: NewOrData -> NewOrData -> Bool

(/=) :: NewOrData -> NewOrData -> Bool

type LWarnDecls pass = XRec pass (WarnDecls pass)

Located Warning Declarations

type LWarnDecl pass = XRec pass (WarnDecl pass)

Located Warning pragma Declaration

type LTyFamInstEqn pass

Arguments

 = XRec pass (TyFamInstEqn pass)

May have AnnKeywordId : AnnSemi when in a list

Located Type Family Instance Equation

type LTyFamInstDecl pass = XRec pass (TyFamInstDecl pass)

Located Type Family Instance Declaration

type LTyFamDefltDecl pass = XRec pass (TyFamDefltDecl pass)

Located type family default declarations.

type LTyClDecl pass = XRec pass (TyClDecl pass)

Located Declaration of a Type or Class

type LStandaloneKindSig pass = XRec pass (StandaloneKindSig pass)

Located Standalone Kind Signature

type LSpliceDecl pass = XRec pass (SpliceDecl pass)

Located Splice Declaration

type LRuleDecls pass = XRec pass (RuleDecls pass)

Located Rule Declarations

type LRuleDecl pass = XRec pass (RuleDecl pass)

Located Rule Declaration

type LRuleBndr pass = XRec pass (RuleBndr pass)

Located Rule Binder

type LRoleAnnotDecl pass = XRec pass (RoleAnnotDecl pass)

Located Role Annotation Declaration

type LInstDecl pass = XRec pass (InstDecl pass)

Located Instance Declaration

type LInjectivityAnn pass = XRec pass (InjectivityAnn pass)

Located Injectivity Annotation

type LHsFunDep pass = XRec pass (FunDep pass)

type LHsDerivingClause pass = XRec pass (HsDerivingClause pass)

type LHsDecl p

Arguments

 = XRec p (HsDecl p)

When in a list this may have

• AnnKeywordId : AnnSemi

type LForeignDecl pass = XRec pass (ForeignDecl pass)

Located Foreign Declaration

type LFamilyResultSig pass = XRec pass (FamilyResultSig pass)

Located type Family Result Signature

type LFamilyDecl pass = XRec pass (FamilyDecl pass)

Located type Family Declaration

type LDocDecl pass = XRec pass DocDecl

Located Documentation comment Declaration

type LDerivStrategy pass = XRec pass (DerivStrategy pass)

A Located DerivStrategy.

type LDerivDecl pass = XRec pass (DerivDecl pass)

Located stand-alone 'deriving instance' declaration

type LDerivClauseTys pass = XRec pass (DerivClauseTys pass)

type LDefaultDecl pass = XRec pass (DefaultDecl pass)

Located Default Declaration

type LDataFamInstDecl pass = XRec pass (DataFamInstDecl pass)

Located Data Family Instance Declaration

type LConDecl pass

Arguments

 = XRec pass (ConDecl pass)

May have AnnKeywordId : AnnSemi when in a GADT constructor list

Located data Constructor Declaration

type LClsInstDecl pass = XRec pass (ClsInstDecl pass)

Located Class Instance Declaration

type LAnnDecl pass = XRec pass (AnnDecl pass)

Located Annotation Declaration

data InstDecl pass

Instance Declaration

Constructors

ClsInstD

Fields

• cid_d_ext :: XClsInstD pass
• cid_inst :: ClsInstDecl pass

DataFamInstD

Fields

• dfid_ext :: XDataFamInstD pass
• dfid_inst :: DataFamInstDecl pass

TyFamInstD

Fields

• tfid_ext :: XTyFamInstD pass
• tfid_inst :: TyFamInstDecl pass

XInstDecl !(XXInstDecl pass)

Instances

ToHie (LocatedA (InstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]

type Anno (InstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA

data InjectivityAnn pass

If the user supplied an injectivity annotation it is represented using InjectivityAnn. At the moment this is a single injectivity condition - see Note [Injectivity annotation]. `Located name` stores the LHS of injectivity condition. `[Located name]` stores the RHS of injectivity condition. Example:

type family Foo a b c = r | r -> a c where ...

This will be represented as "InjectivityAnn r [a, c]"

Constructors

InjectivityAnn (XCInjectivityAnn pass) (LIdP pass) [LIdP pass]

• AnnKeywordId : AnnRarrow, AnnVbar

XInjectivityAnn !(XXInjectivityAnn pass)

Instances

ToHie (Located (InjectivityAnn GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (InjectivityAnn GhcRn) -> HieM [HieAST Type]

type Anno (InjectivityAnn (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InjectivityAnn (GhcPass p)) = SrcSpan

type HsTyPats pass = [LHsTypeArg pass]

Haskell Type Patterns

data HsRuleRn

Constructors

HsRuleRn NameSet NameSet

Instances

Data HsRuleRn

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsRuleRn -> c HsRuleRn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsRuleRn

toConstr :: HsRuleRn -> Constr

dataTypeOf :: HsRuleRn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsRuleRn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsRuleRn)

gmapT :: (forall b. Data b => b -> b) -> HsRuleRn -> HsRuleRn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleRn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsRuleRn -> r

gmapQ :: (forall d. Data d => d -> u) -> HsRuleRn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsRuleRn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsRuleRn -> m HsRuleRn

data HsGroup p

Haskell Group

A HsDecl is categorised into a HsGroup before being fed to the renamer.

Constructors

HsGroup

Fields

• hs_ext :: XCHsGroup p
• hs_valds :: HsValBinds p
• hs_splcds :: [LSpliceDecl p]
• hs_tyclds :: [TyClGroup p]
• hs_derivds :: [LDerivDecl p]
• hs_fixds :: [LFixitySig p]
• hs_defds :: [LDefaultDecl p]
• hs_fords :: [LForeignDecl p]
• hs_warnds :: [LWarnDecls p]
• hs_annds :: [LAnnDecl p]
• hs_ruleds :: [LRuleDecls p]
• hs_docs :: [LDocDecl p]

XHsGroup !(XXHsGroup p)

data HsDerivingClause pass

A single deriving clause of a data declaration.

• AnnKeywordId : AnnDeriving, AnnStock, AnnAnyClass, AnnNewtype, AnnOpen,AnnClose

Constructors

HsDerivingClause

Fields

• deriv_clause_ext :: XCHsDerivingClause pass
• deriv_clause_strategy :: Maybe (LDerivStrategy pass)

  The user-specified strategy (if any) to use when deriving deriv_clause_tys.

• deriv_clause_tys :: LDerivClauseTys pass

  The types to derive.

XHsDerivingClause !(XXHsDerivingClause pass)

Instances

ToHie (Located (HsDerivingClause GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (HsDerivingClause GhcRn) -> HieM [HieAST Type]

ToHie (Located [Located (HsDerivingClause GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: Located [Located (HsDerivingClause GhcRn)] -> HieM [HieAST Type]

type Anno (HsDerivingClause (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (HsDerivingClause (GhcPass p)) = SrcSpan

type HsDeriving pass

Arguments

 = [LHsDerivingClause pass]

The optional deriving clauses of a data declaration. Clauses is plural because one can specify multiple deriving clauses using the -XDerivingStrategies language extension.

The list of LHsDerivingClauses corresponds to exactly what the user requested to derive, in order. If no deriving clauses were specified, the list is empty.

Haskell Deriving clause

data HsDecl p

A Haskell Declaration

Constructors

TyClD (XTyClD p) (TyClDecl p)

Type or Class Declaration

InstD (XInstD p) (InstDecl p)

Instance declaration

DerivD (XDerivD p) (DerivDecl p)

Deriving declaration

ValD (XValD p) (HsBind p)

Value declaration

SigD (XSigD p) (Sig p)

Signature declaration

KindSigD (XKindSigD p) (StandaloneKindSig p)

Standalone kind signature

DefD (XDefD p) (DefaultDecl p)

'default' declaration

ForD (XForD p) (ForeignDecl p)

Foreign declaration

WarningD (XWarningD p) (WarnDecls p)

Warning declaration

AnnD (XAnnD p) (AnnDecl p)

Annotation declaration

RuleD (XRuleD p) (RuleDecls p)

Rule declaration

SpliceD (XSpliceD p) (SpliceDecl p)

Splice declaration (Includes quasi-quotes)

DocD (XDocD p) DocDecl

Documentation comment declaration

RoleAnnotD (XRoleAnnotD p) (RoleAnnotDecl p)

Role annotation declaration

XHsDecl !(XXHsDecl p)

Instances

type Anno (HsDecl (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA

data HsDataDefn pass

Haskell Data type Definition

Constructors

HsDataDefn

Declares a data type or newtype, giving its constructors data/newtype T a = constrs data/newtype instance T [a] = constrs

Fields

• dd_ext :: XCHsDataDefn pass
• dd_ND :: NewOrData
• dd_ctxt :: Maybe (LHsContext pass)

  Context

• dd_cType :: Maybe (XRec pass CType)
• dd_kindSig :: Maybe (LHsKind pass)

  Optional kind signature.

  (Just k) for a GADT-style data, or data instance decl, with explicit kind sig

  Always Nothing for H98-syntax decls

• dd_cons :: [LConDecl pass]

  Data constructors

  For data T a = T1 | T2 a the LConDecls all have ConDeclH98. For data T a where { T1 :: T a } the LConDecls all have ConDeclGADT.

• dd_derivs :: HsDeriving pass

  Optional 'deriving' clause

XHsDataDefn !(XXHsDataDefn pass)

Instances

HasLoc (HsDataDefn GhcRn)

Defined in Compat.HieAst

Methods

loc :: HsDataDefn GhcRn -> SrcSpan

ToHie (HsDataDefn GhcRn)

Defined in Compat.HieAst

Methods

toHie :: HsDataDefn GhcRn -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (HsDataDefn GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (HsDataDefn GhcRn)) -> HieM [HieAST Type]

type HsConDeclH98Details pass = HsConDetails Void (HsScaled pass (LBangType pass)) (XRec pass [LConDeclField pass])

The arguments in a Haskell98-style data constructor.

data HsConDeclGADTDetails pass

The arguments in a GADT constructor. Unlike Haskell98-style constructors, GADT constructors cannot be declared with infix syntax. As a result, we do not use HsConDetails here, as InfixCon would be an unrepresentable state. (There is a notion of infix GADT constructors for the purposes of derived Show instances—see Note [Infix GADT constructors] in GHC.Tc.TyCl—but that is an orthogonal concern.)

Constructors

PrefixConGADT [HsScaled pass (LBangType pass)]

RecConGADT (XRec pass [LConDeclField pass])

Instances

ToHie (HsConDeclGADTDetails GhcRn)

Defined in Compat.HieAst

Methods

toHie :: HsConDeclGADTDetails GhcRn -> HieM [HieAST Type]

pattern XFunDep :: !(XXFunDep pass) -> FunDep pass

data ForeignImport

Constructors

CImport (Located CCallConv) (Located Safety) (Maybe Header) CImportSpec (Located SourceText)

Instances

Data ForeignImport

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ForeignImport -> c ForeignImport

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ForeignImport

toConstr :: ForeignImport -> Constr

dataTypeOf :: ForeignImport -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ForeignImport)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ForeignImport)

gmapT :: (forall b. Data b => b -> b) -> ForeignImport -> ForeignImport

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ForeignImport -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ForeignImport -> r

gmapQ :: (forall d. Data d => d -> u) -> ForeignImport -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ForeignImport -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignImport -> m ForeignImport

Outputable ForeignImport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignImport -> SDoc

ToHie ForeignImport

Defined in Compat.HieAst

Methods

toHie :: ForeignImport -> HieM [HieAST Type]

data ForeignExport

Constructors

CExport (Located CExportSpec) (Located SourceText)

Instances

Data ForeignExport

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ForeignExport -> c ForeignExport

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ForeignExport

toConstr :: ForeignExport -> Constr

dataTypeOf :: ForeignExport -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ForeignExport)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ForeignExport)

gmapT :: (forall b. Data b => b -> b) -> ForeignExport -> ForeignExport

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ForeignExport -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ForeignExport -> r

gmapQ :: (forall d. Data d => d -> u) -> ForeignExport -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ForeignExport -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ForeignExport -> m ForeignExport

Outputable ForeignExport

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: ForeignExport -> SDoc

ToHie ForeignExport

Defined in Compat.HieAst

Methods

toHie :: ForeignExport -> HieM [HieAST Type]

data ForeignDecl pass

Foreign Declaration

Constructors

ForeignImport

Fields

• fd_i_ext :: XForeignImport pass
• fd_name :: LIdP pass
• fd_sig_ty :: LHsSigType pass
• fd_fi :: ForeignImport

ForeignExport

• AnnKeywordId : AnnForeign, AnnImport,AnnExport, AnnDcolon

Fields

• fd_e_ext :: XForeignExport pass
• fd_name :: LIdP pass
• fd_sig_ty :: LHsSigType pass
• fd_fe :: ForeignExport

XForeignDecl !(XXForeignDecl pass)

Instances

ToHie (LocatedA (ForeignDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]

type Anno (ForeignDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA

data FamilyResultSig pass

type Family Result Signature

Constructors

NoSig (XNoSig pass)

• AnnKeywordId :

KindSig (XCKindSig pass) (LHsKind pass)

• AnnKeywordId : AnnOpenP,AnnDcolon, AnnCloseP

TyVarSig (XTyVarSig pass) (LHsTyVarBndr () pass)

• AnnKeywordId : AnnOpenP,AnnDcolon, AnnCloseP, AnnEqual

XFamilyResultSig !(XXFamilyResultSig pass)

Instances

ToHie (RScoped (Located (FamilyResultSig GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (Located (FamilyResultSig GhcRn)) -> HieM [HieAST Type]

type Anno (FamilyResultSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyResultSig (GhcPass p)) = SrcSpan

data FamilyInfo pass

Constructors

DataFamily

OpenTypeFamily

ClosedTypeFamily (Maybe [LTyFamInstEqn pass])

Nothing if we're in an hs-boot file and the user said "type family Foo x where .."

Instances

Outputable (FamilyInfo pass)

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: FamilyInfo pass -> SDoc

ToHie (FamilyInfo GhcRn)

Defined in Compat.HieAst

Methods

toHie :: FamilyInfo GhcRn -> HieM [HieAST Type]

data FamilyDecl pass

type Family Declaration

Constructors

FamilyDecl

Fields

• fdExt :: XCFamilyDecl pass
• fdInfo :: FamilyInfo pass
• fdTopLevel :: TopLevelFlag
• fdLName :: LIdP pass
• fdTyVars :: LHsQTyVars pass
• fdFixity :: LexicalFixity
• fdResultSig :: LFamilyResultSig pass
• fdInjectivityAnn :: Maybe (LInjectivityAnn pass)

XFamilyDecl !(XXFamilyDecl pass)

• AnnKeywordId : AnnType, AnnData, AnnFamily, AnnWhere, AnnOpenP, AnnDcolon, AnnCloseP, AnnEqual, AnnRarrow, AnnVbar

Instances

ToHie (LocatedA (FamilyDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]

type Anno (FamilyDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA

data FamEqn pass rhs

Family Equation

One equation in a type family instance declaration, data family instance declaration, or type family default. See Note [Type family instance declarations in HsSyn] See Note [Family instance declaration binders]

Constructors

FamEqn

Fields

• feqn_ext :: XCFamEqn pass rhs
• feqn_tycon :: LIdP pass
• feqn_bndrs :: HsOuterFamEqnTyVarBndrs pass

  Optional quantified type vars

• feqn_pats :: HsTyPats pass
• feqn_fixity :: LexicalFixity

  Fixity used in the declaration

• feqn_rhs :: rhs
  • AnnKeywordId : AnnEqual

XFamEqn !(XXFamEqn pass rhs)

Instances

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (HsDataDefn GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (HsDataDefn GhcRn)) -> HieM [HieAST Type]

(HasLoc a, HiePass p) => HasLoc (FamEqn (GhcPass p) a)

Defined in Compat.HieAst

Methods

loc :: FamEqn (GhcPass p) a -> SrcSpan

(ToHie rhs, HasLoc rhs) => ToHie (FamEqn GhcRn rhs)

Defined in Compat.HieAst

Methods

toHie :: FamEqn GhcRn rhs -> HieM [HieAST Type]

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

data DocDecl

Documentation comment Declaration

Constructors

DocCommentNext HsDocString

DocCommentPrev HsDocString

DocCommentNamed String HsDocString

DocGroup Int HsDocString

Instances

Data DocDecl

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DocDecl -> c DocDecl

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DocDecl

toConstr :: DocDecl -> Constr

dataTypeOf :: DocDecl -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DocDecl)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DocDecl)

gmapT :: (forall b. Data b => b -> b) -> DocDecl -> DocDecl

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DocDecl -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DocDecl -> r

gmapQ :: (forall d. Data d => d -> u) -> DocDecl -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DocDecl -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DocDecl -> m DocDecl

Outputable DocDecl

Defined in Language.Haskell.Syntax.Decls

Methods

ppr :: DocDecl -> SDoc

type Anno DocDecl

Defined in GHC.Hs.Decls

type Anno DocDecl = SrcSpanAnnA

data DerivStrategy pass

Which technique the user explicitly requested when deriving an instance.

Constructors

StockStrategy (XStockStrategy pass)

GHC's "standard" strategy, which is to implement a custom instance for the data type. This only works for certain types that GHC knows about (e.g., Eq, Show, Functor when -XDeriveFunctor is enabled, etc.)

AnyclassStrategy (XAnyClassStrategy pass)

-XDeriveAnyClass

NewtypeStrategy (XNewtypeStrategy pass)

-XGeneralizedNewtypeDeriving

ViaStrategy (XViaStrategy pass)

-XDerivingVia

Instances

ToHie (Located (DerivStrategy GhcRn))

Defined in Compat.HieAst

Methods

toHie :: Located (DerivStrategy GhcRn) -> HieM [HieAST Type]

type Anno (DerivStrategy (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivStrategy (GhcPass p)) = SrcSpan

data DerivDecl pass

Stand-alone 'deriving instance' declaration

Constructors

DerivDecl

Fields

• deriv_ext :: XCDerivDecl pass
• deriv_type :: LHsSigWcType pass

  The instance type to derive.

  It uses an LHsSigWcType because the context is allowed to be a single wildcard:

  deriving instance _ => Eq (Foo a)

  Which signifies that the context should be inferred.

• deriv_strategy :: Maybe (LDerivStrategy pass)
• deriv_overlap_mode :: Maybe (XRec pass OverlapMode)
  • AnnKeywordId : AnnDeriving, AnnInstance, AnnStock, AnnAnyClass, AnnNewtype, AnnOpen,AnnClose

XDerivDecl !(XXDerivDecl pass)

Instances

ToHie (LocatedA (DerivDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]

type Anno (DerivDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA

data DerivClauseTys pass

The types mentioned in a single deriving clause. This can come in two forms, DctSingle or DctMulti, depending on whether the types are surrounded by enclosing parentheses or not. These parentheses are semantically different than HsParTy. For example, deriving () means "derive zero classes" rather than "derive an instance of the 0-tuple".

DerivClauseTys use LHsSigType because deriving clauses can mention type variables that aren't bound by the datatype, e.g.

data T b = ... deriving (C [a])

should produce a derived instance for C [a] (T b).

Constructors

DctSingle (XDctSingle pass) (LHsSigType pass)

A deriving clause with a single type. Moreover, that type can only be a type constructor without any arguments.

Example: deriving Eq

DctMulti (XDctMulti pass) [LHsSigType pass]

A deriving clause with a comma-separated list of types, surrounded by enclosing parentheses.

Example: deriving (Eq, C a)

XDerivClauseTys !(XXDerivClauseTys pass)

Instances

ToHie (LocatedC (DerivClauseTys GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]

type Anno (DerivClauseTys (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC

data DefaultDecl pass

Default Declaration

Constructors

DefaultDecl (XCDefaultDecl pass) [LHsType pass]

• AnnKeywordIds : AnnDefault, AnnOpen,AnnClose

XDefaultDecl !(XXDefaultDecl pass)

Instances

ToHie (LocatedA (DefaultDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]

type Anno (DefaultDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DefaultDecl (GhcPass p)) = SrcSpanAnnA

newtype DataFamInstDecl pass

Data Family Instance Declaration

Constructors

DataFamInstDecl

• AnnKeywordId : AnnData, AnnNewType,AnnInstance, AnnDcolon AnnWhere,AnnOpen, AnnClose

Fields

• dfid_eqn :: FamEqn pass (HsDataDefn pass)

Instances

ToHie (LocatedA (DataFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]

type Anno (DataFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA

data DataDeclRn

Constructors

DataDeclRn

Fields

• tcdDataCusk :: Bool

  does this have a CUSK? See Note [CUSKs: complete user-supplied kind signatures]

• tcdFVs :: NameSet

Instances

Data DataDeclRn

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> DataDeclRn -> c DataDeclRn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c DataDeclRn

toConstr :: DataDeclRn -> Constr

dataTypeOf :: DataDeclRn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c DataDeclRn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c DataDeclRn)

gmapT :: (forall b. Data b => b -> b) -> DataDeclRn -> DataDeclRn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> DataDeclRn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> DataDeclRn -> r

gmapQ :: (forall d. Data d => d -> u) -> DataDeclRn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> DataDeclRn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> DataDeclRn -> m DataDeclRn

data ConDecl pass

data T b = forall a. Eq a => MkT a b
  MkT :: forall b a. Eq a => MkT a b

data T b where
     MkT1 :: Int -> T Int

data T = Int MkT Int
       | MkT2

data T a where
     Int MkT Int :: T Int

• AnnKeywordIds : AnnOpen, AnnDotdot,AnnCLose, AnnEqual,AnnVbar, AnnDarrow,AnnDarrow, AnnForall,AnnDot

data Constructor Declaration

Constructors

ConDeclGADT

Fields

• con_g_ext :: XConDeclGADT pass
• con_names :: [LIdP pass]
• con_bndrs :: XRec pass (HsOuterSigTyVarBndrs pass)

  The outermost type variable binders, be they explicit or implicit. The XRec is used to anchor exact print annotations, AnnForall and AnnDot.

• con_mb_cxt :: Maybe (LHsContext pass)

  User-written context (if any)

• con_g_args :: HsConDeclGADTDetails pass

  Arguments; never infix

• con_res_ty :: LHsType pass

  Result type

• con_doc :: Maybe LHsDocString

  A possible Haddock comment.

ConDeclH98

Fields

• con_ext :: XConDeclH98 pass
• con_name :: LIdP pass
• con_forall :: Bool

  True = explicit user-written forall e.g. data T a = forall b. MkT b (b->a) con_ex_tvs = {b} False => con_ex_tvs is empty

• con_ex_tvs :: [LHsTyVarBndr Specificity pass]

  Existentials only

• con_mb_cxt :: Maybe (LHsContext pass)

  User-written context (if any)

• con_args :: HsConDeclH98Details pass

  Arguments; can be infix

• con_doc :: Maybe LHsDocString

  A possible Haddock comment.

XConDecl !(XXConDecl pass)

Instances

ToHie (LocatedA (ConDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]

type Anno (ConDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA

data ClsInstDecl pass

Class Instance Declaration

Constructors

ClsInstDecl

Fields

• cid_ext :: XCClsInstDecl pass
• cid_poly_ty :: LHsSigType pass
• cid_binds :: LHsBinds pass
• cid_sigs :: [LSig pass]
• cid_tyfam_insts :: [LTyFamInstDecl pass]
• cid_datafam_insts :: [LDataFamInstDecl pass]
• cid_overlap_mode :: Maybe (XRec pass OverlapMode)
  • AnnKeywordId : AnnOpen, AnnClose,

XClsInstDecl !(XXClsInstDecl pass)

Instances

ToHie (LocatedA (ClsInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]

type Anno (ClsInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA

data CImportSpec

Constructors

CLabel CLabelString

CFunction CCallTarget

CWrapper

Instances

Data CImportSpec

Defined in Language.Haskell.Syntax.Decls

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CImportSpec -> c CImportSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CImportSpec

toConstr :: CImportSpec -> Constr

dataTypeOf :: CImportSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CImportSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CImportSpec)

gmapT :: (forall b. Data b => b -> b) -> CImportSpec -> CImportSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CImportSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CImportSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> CImportSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CImportSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CImportSpec -> m CImportSpec

data AnnProvenance pass

Annotation Provenance

Constructors

ValueAnnProvenance (LIdP pass)

TypeAnnProvenance (LIdP pass)

ModuleAnnProvenance

Instances

ToHie (AnnProvenance GhcRn)

Defined in Compat.HieAst

Methods

toHie :: AnnProvenance GhcRn -> HieM [HieAST Type]

data AnnDecl pass

Annotation Declaration

Constructors

HsAnnotation (XHsAnnotation pass) SourceText (AnnProvenance pass) (XRec pass (HsExpr pass))

• AnnKeywordId : AnnOpen, AnnType AnnModule AnnClose

XAnnDecl !(XXAnnDecl pass)

Instances

ToHie (LocatedA (AnnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]

type Anno (AnnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA

tyClGroupTyClDecls :: [TyClGroup pass] -> [LTyClDecl pass]

tyClGroupRoleDecls :: [TyClGroup pass] -> [LRoleAnnotDecl pass]

tyClGroupKindSigs :: [TyClGroup pass] -> [LStandaloneKindSig pass]

tyClGroupInstDecls :: [TyClGroup pass] -> [LInstDecl pass]

tyClDeclTyVars :: TyClDecl pass -> LHsQTyVars pass

pprFullRuleName :: Located (SourceText, RuleName) -> SDoc

pprFlavour :: FamilyInfo pass -> SDoc

newOrDataToFlavour :: NewOrData -> TyConFlavour

Convert a NewOrData to a TyConFlavour

isTypeFamilyDecl :: TyClDecl pass -> Bool

type family declaration

isSynDecl :: TyClDecl pass -> Bool

type or type instance declaration

isOpenTypeFamilyInfo :: FamilyInfo pass -> Bool

open type family info

isFamilyDecl :: TyClDecl pass -> Bool

type/data family declaration

isDataFamilyDecl :: TyClDecl pass -> Bool

data family declaration

isDataDecl :: TyClDecl pass -> Bool

True = argument is a data/newtype declaration.

isClosedTypeFamilyInfo :: FamilyInfo pass -> Bool

closed type family info

isClassDecl :: TyClDecl pass -> Bool

type class

hsGroupInstDecls :: HsGroup id -> [LInstDecl id]

docDeclDoc :: DocDecl -> HsDocString

derivStrategyName :: DerivStrategy a -> SDoc

A short description of a DerivStrategy'.

countTyClDecls :: [TyClDecl pass] -> (Int, Int, Int, Int, Int)

collectRuleBndrSigTys :: [RuleBndr pass] -> [HsPatSigType pass]

annProvenanceName_maybe :: UnXRec p => AnnProvenance p -> Maybe (IdP p)

data TcSpecPrags

Type checker Specialisation Pragmas

TcSpecPrags conveys SPECIALISE pragmas from the type checker to the desugarer

Constructors

IsDefaultMethod

Super-specialised: a default method should be macro-expanded at every call site

SpecPrags [LTcSpecPrag]

Instances

Data TcSpecPrags

Defined in Language.Haskell.Syntax.Binds

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TcSpecPrags -> c TcSpecPrags

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TcSpecPrags

toConstr :: TcSpecPrags -> Constr

dataTypeOf :: TcSpecPrags -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TcSpecPrags)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TcSpecPrags)

gmapT :: (forall b. Data b => b -> b) -> TcSpecPrags -> TcSpecPrags

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TcSpecPrags -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TcSpecPrags -> r

gmapQ :: (forall d. Data d => d -> u) -> TcSpecPrags -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TcSpecPrags -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TcSpecPrags -> m TcSpecPrags

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TcSpecPrags -> m TcSpecPrags

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TcSpecPrags -> m TcSpecPrags

data TcSpecPrag

Type checker Specification Pragma

Constructors

SpecPrag Id HsWrapper InlinePragma

The Id to be specialised, a wrapper that specialises the polymorphic function, and inlining spec for the specialised function

Instances

Data TcSpecPrag

Defined in Language.Haskell.Syntax.Binds

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TcSpecPrag -> c TcSpecPrag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TcSpecPrag

toConstr :: TcSpecPrag -> Constr

dataTypeOf :: TcSpecPrag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TcSpecPrag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TcSpecPrag)

gmapT :: (forall b. Data b => b -> b) -> TcSpecPrag -> TcSpecPrag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TcSpecPrag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TcSpecPrag -> r

gmapQ :: (forall d. Data d => d -> u) -> TcSpecPrag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TcSpecPrag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TcSpecPrag -> m TcSpecPrag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TcSpecPrag -> m TcSpecPrag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TcSpecPrag -> m TcSpecPrag

data Sig pass

Signatures and pragmas

Constructors

TypeSig (XTypeSig pass) [LIdP pass] (LHsSigWcType pass)

An ordinary type signature

f :: Num a => a -> a

After renaming, this list of Names contains the named wildcards brought into scope by this signature. For a signature _ -> _a -> Bool, the renamer will leave the unnamed wildcard _ untouched, and the named wildcard _a is then replaced with fresh meta vars in the type. Their names are stored in the type signature that brought them into scope, in this third field to be more specific.

• AnnKeywordId : AnnDcolon, AnnComma

PatSynSig (XPatSynSig pass) [LIdP pass] (LHsSigType pass)

A pattern synonym type signature

pattern Single :: () => (Show a) => a -> [a]

• AnnKeywordId : AnnPattern, AnnDcolon,AnnForall AnnDot,AnnDarrow

ClassOpSig (XClassOpSig pass) Bool [LIdP pass] (LHsSigType pass)

A signature for a class method False: ordinary class-method signature True: generic-default class method signature e.g. class C a where op :: a -> a -- Ordinary default op :: Eq a => a -> a -- Generic default No wildcards allowed here

• AnnKeywordId : AnnDefault, AnnDcolon

IdSig (XIdSig pass) Id

A type signature in generated code, notably the code generated for record selectors. We simply record the desired Id itself, replete with its name, type and IdDetails. Otherwise it's just like a type signature: there should be an accompanying binding

FixSig (XFixSig pass) (FixitySig pass)

An ordinary fixity declaration

    infixl 8 ***

• AnnKeywordId : AnnInfix, AnnVal

InlineSig (XInlineSig pass) (LIdP pass) InlinePragma

An inline pragma

{#- INLINE f #-}

• AnnKeywordId : AnnOpen '{-# INLINE' and '[', AnnClose,AnnOpen, AnnVal,AnnTilde, AnnClose

SpecSig (XSpecSig pass) (LIdP pass) [LHsSigType pass] InlinePragma

A specialisation pragma

{-# SPECIALISE f :: Int -> Int #-}

• AnnKeywordId : AnnOpen, AnnOpen '{-# SPECIALISE' and '[', AnnTilde, AnnVal, AnnClose ']' and '#-}', AnnDcolon

SpecInstSig (XSpecInstSig pass) SourceText (LHsSigType pass)

A specialisation pragma for instance declarations only

{-# SPECIALISE instance Eq [Int] #-}

(Class tys); should be a specialisation of the current instance declaration

• AnnKeywordId : AnnOpen, AnnInstance,AnnClose

MinimalSig (XMinimalSig pass) SourceText (LBooleanFormula (LIdP pass))

A minimal complete definition pragma

{-# MINIMAL a | (b, c | (d | e)) #-}

• AnnKeywordId : AnnOpen, AnnVbar,AnnComma, AnnClose

SCCFunSig (XSCCFunSig pass) SourceText (LIdP pass) (Maybe (XRec pass StringLiteral))

A "set cost centre" pragma for declarations

{-# SCC funName #-}

or

{-# SCC funName "cost_centre_name" #-}

CompleteMatchSig (XCompleteMatchSig pass) SourceText (XRec pass [LIdP pass]) (Maybe (LIdP pass))

A complete match pragma

{-# COMPLETE C, D [:: T] #-}

Used to inform the pattern match checker about additional complete matchings which, for example, arise from pattern synonym definitions.

XSig !(XXSig pass)

Instances

HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]

type Anno (Sig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (Sig (GhcPass p)) = SrcSpanAnnA

data RecordPatSynField pass

Record Pattern Synonym Field

Constructors

RecordPatSynField

Fields

• recordPatSynField :: FieldOcc pass

  Field label visible in rest of the file

• recordPatSynPatVar :: LIdP pass

  Filled in by renamer, the name used internally by the pattern

Instances

Outputable (RecordPatSynField a)

Defined in Language.Haskell.Syntax.Binds

Methods

ppr :: RecordPatSynField a -> SDoc

HiePass p => ToHie (PatSynFieldContext (RecordPatSynField (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: PatSynFieldContext (RecordPatSynField (GhcPass p)) -> HieM [HieAST Type]

data PatSynBind idL idR

• AnnKeywordId : AnnPattern, AnnEqual,AnnLarrow, AnnWhere,AnnOpen '{', AnnClose '}',

Pattern Synonym binding

Constructors

PSB

Fields

• psb_ext :: XPSB idL idR

  Post renaming, FVs. See Note [Bind free vars]

• psb_id :: LIdP idL

  Name of the pattern synonym

• psb_args :: HsPatSynDetails idR

  Formal parameter names

• psb_def :: LPat idR

  Right-hand side

• psb_dir :: HsPatSynDir idR

  Directionality

XPatSynBind !(XXPatSynBind idL idR)

Instances

HiePass p => ToHie (Located (PatSynBind (GhcPass p) (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: Located (PatSynBind (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]

type LTcSpecPrag = Located TcSpecPrag

Located Type checker Specification Pragmas

type LSig pass = XRec pass (Sig pass)

Located Signature

type LIPBind id = XRec id (IPBind id)

Located Implicit Parameter Binding

May have AnnKeywordId : AnnSemi when in a list

type LHsLocalBindsLR idL idR = XRec idL (HsLocalBindsLR idL idR)

type LHsLocalBinds id = XRec id (HsLocalBinds id)

Located Haskell local bindings

type LHsBindsLR idL idR = Bag (LHsBindLR idL idR)

Located Haskell Bindings with separate Left and Right identifier types

type LHsBinds id = LHsBindsLR id id

Located Haskell Bindings

type LHsBindLR idL idR = XRec idL (HsBindLR idL idR)

Located Haskell Binding with separate Left and Right identifier types

type LHsBind id = LHsBindLR id id

Located Haskell Binding

type LFixitySig pass = XRec pass (FixitySig pass)

Located Fixity Signature

data IPBind id

Implicit parameter bindings.

These bindings start off as (Left "x") in the parser and stay that way until after type-checking when they are replaced with (Right d), where "d" is the name of the dictionary holding the evidence for the implicit parameter.

• AnnKeywordId : AnnEqual

Constructors

IPBind (XCIPBind id) (Either (XRec id HsIPName) (IdP id)) (LHsExpr id)

XIPBind !(XXIPBind id)

Instances

HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]

type Anno (IPBind (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (IPBind (GhcPass p)) = SrcSpanAnnA

data HsValBindsLR idL idR

Haskell Value bindings with separate Left and Right identifier types (not implicit parameters) Used for both top level and nested bindings May contain pattern synonym bindings

Constructors

ValBinds (XValBinds idL idR) (LHsBindsLR idL idR) [LSig idR]

Value Bindings In

Before renaming RHS; idR is always RdrName Not dependency analysed Recursive by default

XValBindsLR !(XXValBindsLR idL idR)

Value Bindings Out

After renaming RHS; idR can be Name or Id Dependency analysed, later bindings in the list may depend on earlier ones.

Instances

HiePass p => ToHie (RScoped (HsValBindsLR (GhcPass p) (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (HsValBindsLR (GhcPass p) (GhcPass p)) -> HieM [HieAST Type]

type HsValBinds id = HsValBindsLR id id

Haskell Value Bindings

data HsPatSynDir id

Haskell Pattern Synonym Direction

Constructors

Unidirectional

ImplicitBidirectional

ExplicitBidirectional (MatchGroup id (LHsExpr id))

Instances

HiePass p => ToHie (HsPatSynDir (GhcPass p))

Defined in Compat.HieAst

Methods

toHie :: HsPatSynDir (GhcPass p) -> HieM [HieAST Type]

type HsPatSynDetails pass = HsConDetails Void (LIdP pass) [RecordPatSynField pass]

Haskell Pattern Synonym Details

data HsLocalBindsLR idL idR

Haskell Local Bindings with separate Left and Right identifier types

Bindings in a 'let' expression or a 'where' clause

Constructors

HsValBinds (XHsValBinds idL idR) (HsValBindsLR idL idR)

Haskell Value Bindings

HsIPBinds (XHsIPBinds idL idR) (HsIPBinds idR)

Haskell Implicit Parameter Bindings

EmptyLocalBinds (XEmptyLocalBinds idL idR)

Empty Local Bindings

XHsLocalBindsLR !(XXHsLocalBindsLR idL idR)

Instances

HiePass p => ToHie (RScoped (HsLocalBinds (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: RScoped (HsLocalBinds (GhcPass p)) -> HieM [HieAST Type]

type HsLocalBinds id = HsLocalBindsLR id id

Haskell Local Bindings

data HsIPBinds id

Haskell Implicit Parameter Bindings

Constructors

IPBinds (XIPBinds id) [LIPBind id]

XHsIPBinds !(XXHsIPBinds id)

data HsBindLR idL idR

Haskell Binding with separate Left and Right id's

Constructors

FunBind

Function-like Binding

FunBind is used for both functions f x = e and variables f = x -> e and strict variables !x = x + 1

Reason 1: Special case for type inference: see tcMonoBinds.

Reason 2: Instance decls can only have FunBinds, which is convenient. If you change this, you'll need to change e.g. rnMethodBinds

But note that the form f :: a->a = ... parses as a pattern binding, just like (f :: a -> a) = ...

Strict bindings have their strictness recorded in the SrcStrictness of their MatchContext. See Note [FunBind vs PatBind] for details about the relationship between FunBind and PatBind.

AnnKeywordIds

• AnnFunId, attached to each element of fun_matches
• AnnEqual,AnnWhere, AnnOpen,AnnClose,

Fields

• fun_ext :: XFunBind idL idR

  After the renamer (but before the type-checker), this contains the locally-bound free variables of this defn. See Note [Bind free vars]

  After the type-checker, this contains a coercion from the type of the MatchGroup to the type of the Id. Example:

       f :: Int -> forall a. a -> a
       f x y = y
  

  Then the MatchGroup will have type (Int -> a' -> a') (with a free type variable a'). The coercion will take a CoreExpr of this type and convert it to a CoreExpr of type Int -> forall a'. a' -> a' Notice that the coercion captures the free a'.

• fun_id :: LIdP idL
• fun_matches :: MatchGroup idR (LHsExpr idR)

  The payload

• fun_tick :: [CoreTickish]

  Ticks to put on the rhs, if any

PatBind

Pattern Binding

The pattern is never a simple variable; That case is done by FunBind. See Note [FunBind vs PatBind] for details about the relationship between FunBind and PatBind.

Fields

• pat_ext :: XPatBind idL idR

  See Note [Bind free vars]

• pat_lhs :: LPat idL
• pat_rhs :: GRHSs idR (LHsExpr idR)
• pat_ticks :: ([CoreTickish], [[CoreTickish]])

  Ticks to put on the rhs, if any, and ticks to put on the bound variables.

VarBind

Variable Binding

Dictionary binding and suchlike. All VarBinds are introduced by the type checker

Fields

• var_ext :: XVarBind idL idR
• var_id :: IdP idL
• var_rhs :: LHsExpr idR

  Located only for consistency

AbsBinds

Abstraction Bindings

Fields

• abs_ext :: XAbsBinds idL idR
• abs_tvs :: [TyVar]
• abs_ev_vars :: [EvVar]

  Includes equality constraints

• abs_exports :: [ABExport idL]

  AbsBinds only gets used when idL = idR after renaming, but these need to be idL's for the collect... code in HsUtil to have the right type

• abs_ev_binds :: [TcEvBinds]

  Evidence bindings Why a list? See GHC.Tc.TyCl.Instance Note [Typechecking plan for instance declarations]

• abs_binds :: LHsBinds idL

  Typechecked user bindings

• abs_sig :: Bool

PatSynBind

Patterns Synonym Binding

Fields

• (XPatSynBind idL idR)
• (PatSynBind idL idR)
  • AnnKeywordId : AnnPattern, AnnLarrow,AnnEqual, AnnWhere AnnOpen '{',AnnClose '}'

XHsBindsLR !(XXHsBindsLR idL idR)

Instances

HiePass p => HasType (LocatedA (HsBind (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]

type Anno (HsBindLR (GhcPass idL) (GhcPass idR))

Defined in GHC.Hs.Binds

type Anno (HsBindLR (GhcPass idL) (GhcPass idR)) = SrcSpanAnnA

type HsBind id = HsBindLR id id

Haskell Binding

data FixitySig pass

Fixity Signature

Constructors

FixitySig (XFixitySig pass) [LIdP pass] Fixity

XFixitySig !(XXFixitySig pass)

Instances

ToHie (LocatedA (FixitySig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]

type Anno (FixitySig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA

data ABExport p

Abstraction Bindings Export

Constructors

ABE

Fields

• abe_ext :: XABE p
• abe_poly :: IdP p

  Any INLINE pragma is attached to this Id

• abe_mono :: IdP p
• abe_wrap :: HsWrapper

  See Note [ABExport wrapper] Shape: (forall abs_tvs. abs_ev_vars => abe_mono) ~ abe_poly

• abe_prags :: TcSpecPrags

  SPECIALISE pragmas

XABExport !(XXABExport p)

noSpecPrags :: TcSpecPrags

isTypeLSig :: UnXRec p => LSig p -> Bool

isSpecLSig :: UnXRec p => LSig p -> Bool

isSpecInstLSig :: UnXRec p => LSig p -> Bool

isSCCFunSig :: UnXRec p => LSig p -> Bool

isPragLSig :: UnXRec p => LSig p -> Bool

isMinimalLSig :: UnXRec p => LSig p -> Bool

isInlineLSig :: UnXRec p => LSig p -> Bool

isFixityLSig :: UnXRec p => LSig p -> Bool

isDefaultMethod :: TcSpecPrags -> Bool

isCompleteMatchSig :: UnXRec p => LSig p -> Bool

hsSigDoc :: Sig name -> SDoc

hasSpecPrags :: TcSpecPrags -> Bool

type LHsRecUpdField p = XRec p (HsRecUpdField p)

Located Haskell Record Update Field

type LHsRecField' p id arg = XRec p (HsRecField' id arg)

Located Haskell Record Field

type LHsRecField p arg = XRec p (HsRecField p arg)

Located Haskell Record Field

type HsRecUpdField p = HsRecField' (AmbiguousFieldOcc p) (LHsExpr p)

Haskell Record Update Field

data HsRecFields p arg

Haskell Record Fields

HsRecFields is used only for patterns and expressions (not data type declarations)

Constructors

HsRecFields

Fields

• rec_flds :: [LHsRecField p arg]
• rec_dotdot :: Maybe (Located Int)

Instances

(ToHie arg, HasLoc arg, Data arg, HiePass p) => ToHie (RContext (HsRecFields (GhcPass p) arg))

Defined in Compat.HieAst

Methods

toHie :: RContext (HsRecFields (GhcPass p) arg) -> HieM [HieAST Type]

(Outputable arg, Outputable (XRec p (HsRecField p arg))) => Outputable (HsRecFields p arg)

Defined in Language.Haskell.Syntax.Pat

Methods

ppr :: HsRecFields p arg -> SDoc

data HsRecField' id arg

Haskell Record Field

• AnnKeywordId : AnnEqual,

For details on above see note [exact print annotations] in GHC.Parser.Annotation

Constructors

HsRecField

Fields

• hsRecFieldAnn :: XHsRecField id
• hsRecFieldLbl :: Located id
• hsRecFieldArg :: arg

  Filled in by renamer when punning

• hsRecPun :: Bool

  Note [Punning]

Instances

Foldable (HsRecField' id)

Defined in Language.Haskell.Syntax.Pat

Methods

fold :: Monoid m => HsRecField' id m -> m

foldMap :: Monoid m => (a -> m) -> HsRecField' id a -> m

foldMap' :: Monoid m => (a -> m) -> HsRecField' id a -> m

foldr :: (a -> b -> b) -> b -> HsRecField' id a -> b

foldr' :: (a -> b -> b) -> b -> HsRecField' id a -> b

foldl :: (b -> a -> b) -> b -> HsRecField' id a -> b

foldl' :: (b -> a -> b) -> b -> HsRecField' id a -> b

foldr1 :: (a -> a -> a) -> HsRecField' id a -> a

foldl1 :: (a -> a -> a) -> HsRecField' id a -> a

toList :: HsRecField' id a -> [a]

null :: HsRecField' id a -> Bool

length :: HsRecField' id a -> Int

elem :: Eq a => a -> HsRecField' id a -> Bool

maximum :: Ord a => HsRecField' id a -> a

minimum :: Ord a => HsRecField' id a -> a

sum :: Num a => HsRecField' id a -> a

product :: Num a => HsRecField' id a -> a

Traversable (HsRecField' id)

Defined in Language.Haskell.Syntax.Pat

Methods

traverse :: Applicative f => (a -> f b) -> HsRecField' id a -> f (HsRecField' id b)

sequenceA :: Applicative f => HsRecField' id (f a) -> f (HsRecField' id a)

mapM :: Monad m => (a -> m b) -> HsRecField' id a -> m (HsRecField' id b)

sequence :: Monad m => HsRecField' id (m a) -> m (HsRecField' id a)

Functor (HsRecField' id)

Defined in Language.Haskell.Syntax.Pat

Methods

fmap :: (a -> b) -> HsRecField' id a -> HsRecField' id b

(<$) :: a -> HsRecField' id b -> HsRecField' id a

(ToHie (RFContext (Located label)), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsRecField' label arg)))

Defined in Compat.HieAst

Methods

toHie :: RContext (LocatedA (HsRecField' label arg)) -> HieM [HieAST Type]

(Outputable p, OutputableBndr p, Outputable arg) => Outputable (HsRecField' p arg)

Defined in Language.Haskell.Syntax.Pat

Methods

ppr :: HsRecField' p arg -> SDoc

type Anno (HsRecField (GhcPass p) arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField (GhcPass p) arg) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (HsRecField' p arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField' p arg) = SrcSpanAnnA

type HsRecField p arg = HsRecField' (FieldOcc p) arg

Haskell Record Field

type HsConPatDetails p = HsConDetails (HsPatSigType (NoGhcTc p)) (LPat p) (HsRecFields p (LPat p))

Haskell Constructor Pattern Details

type family ConLikeP x

Instances

type ConLikeP GhcPs

Defined in GHC.Hs.Pat

type ConLikeP GhcPs = RdrName

type ConLikeP GhcRn

Defined in GHC.Hs.Pat

type ConLikeP GhcRn = Name

type ConLikeP GhcTc

Defined in GHC.Hs.Pat

type ConLikeP GhcTc = ConLike

hsRecFieldsArgs :: UnXRec p => HsRecFields p arg -> [arg]

hsRecFields :: UnXRec p => HsRecFields p arg -> [XCFieldOcc p]

hsRecFieldSel :: HsRecField pass arg -> Located (XCFieldOcc pass)

hsConPatArgs :: UnXRec p => HsConPatDetails p -> [LPat p]

type LHsWcType pass = HsWildCardBndrs pass (LHsType pass)

Located Haskell Wildcard Type

type LHsTypeArg p = HsArg (LHsType p) (LHsKind p)

type LHsType pass

Arguments

 = XRec pass (HsType pass)

May have AnnKeywordId : AnnComma when in a list

Located Haskell Type

type LHsTyVarBndr flag pass = XRec pass (HsTyVarBndr flag pass)

Located Haskell Type Variable Binder

type LHsSigWcType pass = HsWildCardBndrs pass (LHsSigType pass)

Located Haskell Signature Wildcard Type

type LHsSigType pass = XRec pass (HsSigType pass)

Located Haskell Signature Type

data LHsQTyVars pass

Located Haskell Quantified Type Variables

Constructors

HsQTvs

Fields

• hsq_ext :: XHsQTvs pass
• hsq_explicit :: [LHsTyVarBndr () pass]

XLHsQTyVars !(XXLHsQTyVars pass)

Instances

ToHie (TScoped (LHsQTyVars GhcRn))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LHsQTyVars GhcRn) -> HieM [HieAST Type]

type LHsKind pass

Arguments

 = XRec pass (HsKind pass)

AnnKeywordId : AnnDcolon

Located Haskell Kind

type LHsContext pass

Arguments

 = XRec pass (HsContext pass)

AnnKeywordId : AnnUnit For details on above see note [exact print annotations] in GHC.Parser.Annotation

Located Haskell Context

type LFieldOcc pass = XRec pass (FieldOcc pass)

Located Field Occurrence

type LConDeclField pass

Arguments

 = XRec pass (ConDeclField pass)

May have AnnKeywordId : AnnComma when in a list

Located Constructor Declaration Field

type LBangType pass = XRec pass (BangType pass)

Located Bang Type

data HsWildCardBndrs pass thing

Haskell Wildcard Binders

Constructors

HsWC

Fields

• hswc_ext :: XHsWC pass thing
• hswc_body :: thing

XHsWildCardBndrs !(XXHsWildCardBndrs pass thing)

Instances

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

data HsType pass

Haskell Type

Constructors

HsForAllTy

• AnnKeywordId : AnnForall, AnnDot,AnnDarrow For details on above see note [exact print annotations] in GHC.Parser.Annotation

Fields

• hst_xforall :: XForAllTy pass
• hst_tele :: HsForAllTelescope pass
• hst_body :: LHsType pass

HsQualTy

Fields

• hst_xqual :: XQualTy pass
• hst_ctxt :: Maybe (LHsContext pass)
• hst_body :: LHsType pass

HsTyVar (XTyVar pass) PromotionFlag (LIdP pass)

• AnnKeywordId : None

HsAppTy (XAppTy pass) (LHsType pass) (LHsType pass)

• AnnKeywordId : None

HsAppKindTy (XAppKindTy pass) (LHsType pass) (LHsKind pass)

HsFunTy (XFunTy pass) (HsArrow pass) (LHsType pass) (LHsType pass)

• AnnKeywordId : AnnRarrow,

HsListTy (XListTy pass) (LHsType pass)

• AnnKeywordId : AnnOpen '[', AnnClose ']'

HsTupleTy (XTupleTy pass) HsTupleSort [LHsType pass]

• AnnKeywordId : AnnOpen '(' or '(#', AnnClose ')' or '#)'

HsSumTy (XSumTy pass) [LHsType pass]

• AnnKeywordId : AnnOpen '(#', AnnClose '#)'@

HsOpTy (XOpTy pass) (LHsType pass) (LIdP pass) (LHsType pass)

• AnnKeywordId : None

HsParTy (XParTy pass) (LHsType pass)

• AnnKeywordId : AnnOpen '(', AnnClose ')'

HsIParamTy (XIParamTy pass) (XRec pass HsIPName) (LHsType pass)

(?x :: ty)

• AnnKeywordId : AnnDcolon

HsStarTy (XStarTy pass) Bool

• AnnKeywordId : None

HsKindSig (XKindSig pass) (LHsType pass) (LHsKind pass)

(ty :: kind)

• AnnKeywordId : AnnOpen '(', AnnDcolon,AnnClose ')'

HsSpliceTy (XSpliceTy pass) (HsSplice pass)

• AnnKeywordId : AnnOpen '$(', AnnClose ')'

HsDocTy (XDocTy pass) (LHsType pass) LHsDocString

• AnnKeywordId : None

HsBangTy (XBangTy pass) HsSrcBang (LHsType pass)

• AnnKeywordId : AnnOpen '{-# UNPACK' or '{-# NOUNPACK', AnnClose '#-}' AnnBang '!'

HsRecTy (XRecTy pass) [LConDeclField pass]

• AnnKeywordId : AnnOpen '{', AnnClose '}'

HsExplicitListTy (XExplicitListTy pass) PromotionFlag [LHsType pass]

• AnnKeywordId : AnnOpen "'[", AnnClose ']'

HsExplicitTupleTy (XExplicitTupleTy pass) [LHsType pass]

• AnnKeywordId : AnnOpen "'(", AnnClose ')'

HsTyLit (XTyLit pass) HsTyLit

• AnnKeywordId : None

HsWildCardTy (XWildCardTy pass)

• AnnKeywordId : None

XHsType !(XXType pass)

Instances

DisambTD (HsType GhcPs)

Defined in GHC.Parser.PostProcess

Methods

mkHsAppTyHeadPV :: LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkHsAppTyPV :: LocatedA (HsType GhcPs) -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkHsAppKindTyPV :: LocatedA (HsType GhcPs) -> SrcSpan -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkHsOpTyPV :: LHsType GhcPs -> LocatedN RdrName -> LHsType GhcPs -> PV (LocatedA (HsType GhcPs))

mkUnpackednessPV :: Located UnpackednessPragma -> LocatedA (HsType GhcPs) -> PV (LocatedA (HsType GhcPs))

ToHie (LocatedA (HsType GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]

ToHie (LocatedC [LocatedA (HsType GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

type Anno (BangType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (BangType (GhcPass p)) = SrcSpanAnnA

type Anno (HsKind (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsKind (GhcPass p)) = SrcSpanAnnA

type Anno (HsType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsType (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

data HsTyVarBndr flag pass

Haskell Type Variable Binder The flag annotates the binder. It is Specificity in places where explicit specificity is allowed (e.g. x :: forall {a} b. ...) or () in other places.

Constructors

UserTyVar (XUserTyVar pass) flag (LIdP pass)

KindedTyVar (XKindedTyVar pass) flag (LIdP pass) (LHsKind pass)

• AnnKeywordId : AnnOpen, AnnDcolon, AnnClose

XTyVarBndr !(XXTyVarBndr pass)

Instances

Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]

type Anno (HsTyVarBndr _flag (GhcPass _1))

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcPs)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcRn)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcTc)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA

data HsTyLit

Haskell Type Literal

Constructors

HsNumTy SourceText Integer

HsStrTy SourceText FastString

HsCharTy SourceText Char

Instances

Data HsTyLit

Defined in Language.Haskell.Syntax.Type

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsTyLit -> c HsTyLit

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsTyLit

toConstr :: HsTyLit -> Constr

dataTypeOf :: HsTyLit -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsTyLit)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsTyLit)

gmapT :: (forall b. Data b => b -> b) -> HsTyLit -> HsTyLit

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsTyLit -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsTyLit -> r

gmapQ :: (forall d. Data d => d -> u) -> HsTyLit -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsTyLit -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsTyLit -> m HsTyLit

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsTyLit -> m HsTyLit

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsTyLit -> m HsTyLit

Outputable HsTyLit

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsTyLit -> SDoc

data HsTupleSort

Haskell Tuple Sort

Constructors

HsUnboxedTuple

HsBoxedOrConstraintTuple

Instances

Data HsTupleSort

Defined in Language.Haskell.Syntax.Type

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsTupleSort -> c HsTupleSort

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsTupleSort

toConstr :: HsTupleSort -> Constr

dataTypeOf :: HsTupleSort -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsTupleSort)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsTupleSort)

gmapT :: (forall b. Data b => b -> b) -> HsTupleSort -> HsTupleSort

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsTupleSort -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsTupleSort -> r

gmapQ :: (forall d. Data d => d -> u) -> HsTupleSort -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsTupleSort -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsTupleSort -> m HsTupleSort

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsTupleSort -> m HsTupleSort

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsTupleSort -> m HsTupleSort

data HsSigType pass

A type signature that obeys the forall-or-nothing rule. In other words, an LHsType that uses an HsOuterSigTyVarBndrs to represent its outermost type variable quantification. See Note [Representing type signatures].

Constructors

HsSig

Fields

• sig_ext :: XHsSig pass
• sig_bndrs :: HsOuterSigTyVarBndrs pass
• sig_body :: LHsType pass

XHsSigType !(XXHsSigType pass)

Instances

ToHie (TScoped (LocatedA (HsSigType GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]

type Anno (HsSigType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA

data HsScaled pass a

This is used in the syntax. In constructor declaration. It must keep the arrow representation.

Constructors

HsScaled (HsArrow pass) a

Instances

Outputable a => Outputable (HsScaled pass a)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsScaled pass a -> SDoc

ToHie a => ToHie (HsScaled GhcRn a)

Defined in Compat.HieAst

Methods

toHie :: HsScaled GhcRn a -> HieM [HieAST Type]

data HsPatSigType pass

Types that can appear in pattern signatures, as well as the signatures for term-level binders in RULES. See Note [Pattern signature binders and scoping].

This is very similar to HsSigWcType, but with slightly different semantics: see Note [HsType binders]. See also Note [The wildcard story for types].

Constructors

HsPS

Fields

• hsps_ext :: XHsPS pass

  After renamer: HsPSRn

• hsps_body :: LHsType pass

  Main payload (the type itself)

XHsPatSigType !(XXHsPatSigType pass)

Instances

ToHie (TScoped (HsPatSigType GhcRn))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsPatSigType GhcRn) -> HieM [HieAST Type]

data HsPSRn

The extension field for HsPatSigType, which is only used in the renamer onwards. See Note [Pattern signature binders and scoping].

Constructors

HsPSRn

Fields

• hsps_nwcs :: [Name]

  Wildcard names

• hsps_imp_tvs :: [Name]

  Implicitly bound variable names

Instances

Data HsPSRn

Defined in Language.Haskell.Syntax.Type

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsPSRn -> c HsPSRn

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsPSRn

toConstr :: HsPSRn -> Constr

dataTypeOf :: HsPSRn -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsPSRn)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsPSRn)

gmapT :: (forall b. Data b => b -> b) -> HsPSRn -> HsPSRn

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsPSRn -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsPSRn -> r

gmapQ :: (forall d. Data d => d -> u) -> HsPSRn -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsPSRn -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsPSRn -> m HsPSRn

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsPSRn -> m HsPSRn

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsPSRn -> m HsPSRn

data HsOuterTyVarBndrs flag pass

The outermost type variables in a type that obeys the forall-or-nothing rule. See Note [forall-or-nothing rule].

Constructors

HsOuterImplicit

Implicit forall, e.g., f :: a -> b -> b

Fields

• hso_ximplicit :: XHsOuterImplicit pass

HsOuterExplicit

Explicit forall, e.g., f :: forall a b. a -> b -> b

Fields

• hso_xexplicit :: XHsOuterExplicit pass flag
• hso_bndrs :: [LHsTyVarBndr flag (NoGhcTc pass)]

XHsOuterTyVarBndrs !(XXHsOuterTyVarBndrs pass)

Instances

Data flag => ToHie (TVScoped (HsOuterTyVarBndrs flag GhcRn))

Defined in Compat.HieAst

Methods

toHie :: TVScoped (HsOuterTyVarBndrs flag GhcRn) -> HieM [HieAST Type]

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))

Defined in GHC.Hs.Type

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA

type HsOuterSigTyVarBndrs = HsOuterTyVarBndrs Specificity

Used for signatures, e.g.,

f :: forall a {b}. blah

We use Specificity for the HsOuterTyVarBndrs flag to allow distinguishing between specified and inferred type variables.

type HsOuterFamEqnTyVarBndrs = HsOuterTyVarBndrs ()

Used for type-family instance equations, e.g.,

type instance forall a. F [a] = Tree a

The notion of specificity is irrelevant in type family equations, so we use () for the HsOuterTyVarBndrs flag.

type HsKind pass = HsType pass

Haskell Kind

newtype HsIPName

These names are used early on to store the names of implicit parameters. They completely disappear after type-checking.

Constructors

HsIPName FastString

Instances

Data HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsIPName -> c HsIPName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsIPName

toConstr :: HsIPName -> Constr

dataTypeOf :: HsIPName -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsIPName)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsIPName)

gmapT :: (forall b. Data b => b -> b) -> HsIPName -> HsIPName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsIPName -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsIPName -> r

gmapQ :: (forall d. Data d => d -> u) -> HsIPName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsIPName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsIPName -> m HsIPName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsIPName -> m HsIPName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsIPName -> m HsIPName

Outputable HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsIPName -> SDoc

OutputableBndr HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> HsIPName -> SDoc

pprPrefixOcc :: HsIPName -> SDoc

pprInfixOcc :: HsIPName -> SDoc

bndrIsJoin_maybe :: HsIPName -> Maybe Int

Eq HsIPName

Defined in Language.Haskell.Syntax.Type

Methods

(==) :: HsIPName -> HsIPName -> Bool

(/=) :: HsIPName -> HsIPName -> Bool

ToHie (Located HsIPName)

Defined in Compat.HieAst

Methods

toHie :: Located HsIPName -> HieM [HieAST Type]

type Anno HsIPName

Defined in GHC.Hs.Type

type Anno HsIPName = SrcSpan

data HsForAllTelescope pass

The type variable binders in an HsForAllTy. See also Note [Variable Specificity and Forall Visibility] in GHC.Tc.Gen.HsType.

Constructors

HsForAllVis

A visible forall (e.g., forall a -> {...}). These do not have any notion of specificity, so we use () as a placeholder value.

Fields

• hsf_xvis :: XHsForAllVis pass
• hsf_vis_bndrs :: [LHsTyVarBndr () pass]

HsForAllInvis

An invisible forall (e.g., forall a {b} c. {...}), where each binder has a Specificity.

Fields

• hsf_xinvis :: XHsForAllInvis pass
• hsf_invis_bndrs :: [LHsTyVarBndr Specificity pass]

XHsForAllTelescope !(XXHsForAllTelescope pass)

type HsCoreTy = Type

type HsContext pass = [LHsType pass]

Haskell Context

data HsConDetails tyarg arg rec

Describes the arguments to a data constructor. This is a common representation for several constructor-related concepts, including:

• The arguments in a Haskell98-style constructor declaration (see HsConDeclH98Details in GHC.Hs.Decls).
• The arguments in constructor patterns in case/function definitions (see HsConPatDetails in GHC.Hs.Pat).
• The left-hand side arguments in a pattern synonym binding (see HsPatSynDetails in GHC.Hs.Binds).

One notable exception is the arguments in a GADT constructor, which uses a separate data type entirely (see HsConDeclGADTDetails in GHC.Hs.Decls). This is because GADT constructors cannot be declared with infix syntax, unlike the concepts above (#18844).

Constructors

PrefixCon [tyarg] [arg]

RecCon rec

InfixCon arg arg

Instances

(Data tyarg, Data arg, Data rec) => Data (HsConDetails tyarg arg rec)

Defined in Language.Haskell.Syntax.Type

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsConDetails tyarg arg rec -> c (HsConDetails tyarg arg rec)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (HsConDetails tyarg arg rec)

toConstr :: HsConDetails tyarg arg rec -> Constr

dataTypeOf :: HsConDetails tyarg arg rec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (HsConDetails tyarg arg rec))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (HsConDetails tyarg arg rec))

gmapT :: (forall b. Data b => b -> b) -> HsConDetails tyarg arg rec -> HsConDetails tyarg arg rec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsConDetails tyarg arg rec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsConDetails tyarg arg rec -> r

gmapQ :: (forall d. Data d => d -> u) -> HsConDetails tyarg arg rec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsConDetails tyarg arg rec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsConDetails tyarg arg rec -> m (HsConDetails tyarg arg rec)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsConDetails tyarg arg rec -> m (HsConDetails tyarg arg rec)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsConDetails tyarg arg rec -> m (HsConDetails tyarg arg rec)

(Outputable tyarg, Outputable arg, Outputable rec) => Outputable (HsConDetails tyarg arg rec)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsConDetails tyarg arg rec -> SDoc

(ToHie tyarg, ToHie arg, ToHie rec) => ToHie (HsConDetails tyarg arg rec)

Defined in Compat.HieAst

Methods

toHie :: HsConDetails tyarg arg rec -> HieM [HieAST Type]

data HsArrow pass

Denotes the type of arrows in the surface language

Constructors

HsUnrestrictedArrow IsUnicodeSyntax

a -> b or a → b

HsLinearArrow IsUnicodeSyntax (Maybe AddEpAnn)

a %1 -> b or a %1 → b, or a ⊸ b

HsExplicitMult IsUnicodeSyntax (Maybe AddEpAnn) (LHsType pass)

a %m -> b or a %m → b (very much including `a %Many -> b`! This is how the programmer wrote it). It is stored as an HsType so as to preserve the syntax as written in the program.

data HsArg tm ty

Constructors

HsValArg tm

HsTypeArg SrcSpan ty

HsArgPar SrcSpan

Instances

(Outputable tm, Outputable ty) => Outputable (HsArg tm ty)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: HsArg tm ty -> SDoc

(HasLoc tm, HasLoc ty) => HasLoc (HsArg tm ty)

Defined in Compat.HieAst

Methods

loc :: HsArg tm ty -> SrcSpan

(ToHie tm, ToHie ty) => ToHie (HsArg tm ty)

Defined in Compat.HieAst

Methods

toHie :: HsArg tm ty -> HieM [HieAST Type]

data FieldOcc pass

Field Occurrence

Represents an *occurrence* of an unambiguous field. This may or may not be a binding occurrence (e.g. this type is used in ConDeclField and RecordPatSynField which bind their fields, but also in HsRecField for record construction and patterns, which do not).

We store both the RdrName the user originally wrote, and after the renamer, the selector function.

Constructors

FieldOcc

Fields

• extFieldOcc :: XCFieldOcc pass
• rdrNameFieldOcc :: LocatedN RdrName

  See Note [Located RdrNames] in GHC.Hs.Expr

XFieldOcc !(XXFieldOcc pass)

Instances

Outputable (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

ppr :: FieldOcc pass -> SDoc

OutputableBndr (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> FieldOcc pass -> SDoc

pprPrefixOcc :: FieldOcc pass -> SDoc

pprInfixOcc :: FieldOcc pass -> SDoc

bndrIsJoin_maybe :: FieldOcc pass -> Maybe Int

(Eq (XCFieldOcc pass), Eq (XXFieldOcc pass)) => Eq (FieldOcc pass)

Defined in Language.Haskell.Syntax.Type

Methods

(==) :: FieldOcc pass -> FieldOcc pass -> Bool

(/=) :: FieldOcc pass -> FieldOcc pass -> Bool

HiePass p => ToHie (Context (FieldOcc (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: Context (FieldOcc (GhcPass p)) -> HieM [HieAST Type]

ToHie (RFContext (Located (FieldOcc GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (FieldOcc GhcRn)) -> HieM [HieAST Type]

ToHie (RFContext (Located (FieldOcc GhcTc)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (FieldOcc GhcTc)) -> HieM [HieAST Type]

OutputableBndr (GenLocated SrcSpan (FieldOcc pass))

Defined in Language.Haskell.Syntax.Type

Methods

pprBndr :: BindingSite -> GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprPrefixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

pprInfixOcc :: GenLocated SrcSpan (FieldOcc pass) -> SDoc

bndrIsJoin_maybe :: GenLocated SrcSpan (FieldOcc pass) -> Maybe Int

type Anno (FieldOcc (GhcPass p))

Defined in GHC.Hs.Type

type Anno (FieldOcc (GhcPass p)) = SrcSpan

type Anno (HsRecField (GhcPass p) arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField (GhcPass p) arg) = SrcSpanAnnA

data ConDeclField pass

Constructor Declaration Field

Constructors

ConDeclField

Fields

• cd_fld_ext :: XConDeclField pass
• cd_fld_names :: [LFieldOcc pass]

  See Note [ConDeclField passs]

• cd_fld_type :: LBangType pass
• cd_fld_doc :: Maybe LHsDocString
  • AnnKeywordId : AnnDcolon

XConDeclField !(XXConDeclField pass)

Instances

ToHie (LocatedA (ConDeclField GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]

ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]

type Anno (ConDeclField (GhcPass p))

Defined in GHC.Hs.Type

type Anno (ConDeclField (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type BangType pass = HsType pass

Bang Type

In the parser, strictness and packedness annotations bind more tightly than docstrings. This means that when consuming a BangType (and looking for HsBangTy) we must be ready to peer behind a potential layer of HsDocTy. See #15206 for motivation and getBangType for an example.

data AmbiguousFieldOcc pass

Ambiguous Field Occurrence

Represents an *occurrence* of a field that is potentially ambiguous after the renamer, with the ambiguity resolved by the typechecker. We always store the RdrName that the user originally wrote, and store the selector function after the renamer (for unambiguous occurrences) or the typechecker (for ambiguous occurrences).

See Note [HsRecField and HsRecUpdField] in GHC.Hs.Pat and Note [Disambiguating record fields] in GHC.Tc.Gen.Head. See Note [Located RdrNames] in GHC.Hs.Expr

Constructors

Unambiguous (XUnambiguous pass) (LocatedN RdrName)

Ambiguous (XAmbiguous pass) (LocatedN RdrName)

XAmbiguousFieldOcc !(XXAmbiguousFieldOcc pass)

Instances

ToHie (RFContext (Located (AmbiguousFieldOcc GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcRn)) -> HieM [HieAST Type]

ToHie (RFContext (Located (AmbiguousFieldOcc GhcTc)))

Defined in Compat.HieAst

Methods

toHie :: RFContext (Located (AmbiguousFieldOcc GhcTc)) -> HieM [HieAST Type]

type Anno (AmbiguousFieldOcc GhcTc)

Defined in GHC.Hs.Pat

type Anno (AmbiguousFieldOcc GhcTc) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

numVisibleArgs :: [HsArg tm ty] -> Arity

noTypeArgs :: [Void]

An empty list that can be used to indicate that there are no type arguments allowed in cases where HsConDetails is applied to Void.

mapHsOuterImplicit :: (XHsOuterImplicit pass -> XHsOuterImplicit pass) -> HsOuterTyVarBndrs flag pass -> HsOuterTyVarBndrs flag pass

isHsKindedTyVar :: HsTyVarBndr flag pass -> Bool

Does this HsTyVarBndr come with an explicit kind annotation?

hsUnrestricted :: a -> HsScaled pass a

When creating syntax we use the shorthands. It's better for printing, also, the shorthands work trivially at each pass.

hsScaledThing :: HsScaled pass a -> a

hsQTvExplicit :: LHsQTyVars pass -> [LHsTyVarBndr () pass]

hsPatSigType :: HsPatSigType pass -> LHsType pass

hsMult :: HsScaled pass a -> HsArrow pass

hsLinear :: a -> HsScaled pass a

When creating syntax we use the shorthands. It's better for printing, also, the shorthands work trivially at each pass.

hsIPNameFS :: HsIPName -> FastString

data Pat p

Pattern

• AnnKeywordId : AnnBang

Constructors

WildPat (XWildPat p)

Wildcard Pattern The sole reason for a type on a WildPat is to support hsPatType :: Pat Id -> Type

VarPat (XVarPat p) (LIdP p)

Variable Pattern

LazyPat (XLazyPat p) (LPat p)

Lazy Pattern ^ - AnnKeywordId : AnnTilde

AsPat (XAsPat p) (LIdP p) (LPat p)

As pattern ^ - AnnKeywordId : AnnAt

ParPat (XParPat p) (LPat p)

Parenthesised pattern See Note [Parens in HsSyn] in GHC.Hs.Expr ^ - AnnKeywordId : AnnOpen '(', AnnClose ')'

BangPat (XBangPat p) (LPat p)

Bang pattern ^ - AnnKeywordId : AnnBang

ListPat (XListPat p) [LPat p]

Syntactic List

• AnnKeywordId : AnnOpen '[', AnnClose ']'

TuplePat (XTuplePat p) [LPat p] Boxity

Tuple sub-patterns

• AnnKeywordId : AnnOpen '(' or '(#', AnnClose ')' or '#)'

SumPat (XSumPat p) (LPat p) ConTag Arity

Anonymous sum pattern

• AnnKeywordId : AnnOpen '(#', AnnClose '#)'

ConPat

Constructor Pattern

Fields

• pat_con_ext :: XConPat p
• pat_con :: XRec p (ConLikeP p)
• pat_args :: HsConPatDetails p

ViewPat

• AnnKeywordId : AnnRarrow

Fields

• (XViewPat p)
• (LHsExpr p)
• (LPat p)

  View Pattern

SplicePat

• AnnKeywordId : AnnOpen '$(' AnnClose ')'

Fields

• (XSplicePat p)
• (HsSplice p)

  Splice Pattern (Includes quasi-quotes)

LitPat (XLitPat p) (HsLit p)

Literal Pattern Used for *non-overloaded* literal patterns: Int#, Char#, Int, Char, String, etc.

NPat (XNPat p) (XRec p (HsOverLit p)) (Maybe (SyntaxExpr p)) (SyntaxExpr p)

Natural Pattern

• AnnKeywordId : AnnVal +

NPlusKPat (XNPlusKPat p) (LIdP p) (XRec p (HsOverLit p)) (HsOverLit p) (SyntaxExpr p) (SyntaxExpr p)

n+k pattern

SigPat

• AnnKeywordId : AnnDcolon

Fields

• (XSigPat p)
• (LPat p)
• (HsPatSigType (NoGhcTc p))

  Pattern with a type signature

XPat !(XXPat p)

Trees that Grow extension point for new constructors

Instances

HiePass p => HasType (LocatedA (Pat (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]

type Anno (Pat (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (Pat (GhcPass p)) = SrcSpanAnnA

type LPat p = XRec p (Pat p)

data OverLitVal

Overloaded Literal Value

Constructors

HsIntegral !IntegralLit

Integer-looking literals;

HsFractional !FractionalLit

Frac-looking literals

HsIsString !SourceText !FastString

String-looking literals

Instances

Data OverLitVal

Defined in Language.Haskell.Syntax.Lit

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OverLitVal -> c OverLitVal

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OverLitVal

toConstr :: OverLitVal -> Constr

dataTypeOf :: OverLitVal -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OverLitVal)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OverLitVal)

gmapT :: (forall b. Data b => b -> b) -> OverLitVal -> OverLitVal

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OverLitVal -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OverLitVal -> r

gmapQ :: (forall d. Data d => d -> u) -> OverLitVal -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> OverLitVal -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> OverLitVal -> m OverLitVal

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OverLitVal -> m OverLitVal

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OverLitVal -> m OverLitVal

Outputable OverLitVal

Defined in Language.Haskell.Syntax.Lit

Methods

ppr :: OverLitVal -> SDoc

Eq OverLitVal

Defined in Language.Haskell.Syntax.Lit

Methods

(==) :: OverLitVal -> OverLitVal -> Bool

(/=) :: OverLitVal -> OverLitVal -> Bool

Ord OverLitVal

Defined in Language.Haskell.Syntax.Lit

Methods

compare :: OverLitVal -> OverLitVal -> Ordering

(<) :: OverLitVal -> OverLitVal -> Bool

(<=) :: OverLitVal -> OverLitVal -> Bool

(>) :: OverLitVal -> OverLitVal -> Bool

(>=) :: OverLitVal -> OverLitVal -> Bool

max :: OverLitVal -> OverLitVal -> OverLitVal

min :: OverLitVal -> OverLitVal -> OverLitVal

data HsOverLit p

Haskell Overloaded Literal

Constructors

OverLit

Fields

• ol_ext :: XOverLit p
• ol_val :: OverLitVal
• ol_witness :: HsExpr p

XOverLit !(XXOverLit p)

Instances

Eq (XXOverLit p) => Eq (HsOverLit p)

Defined in Language.Haskell.Syntax.Lit

Methods

(==) :: HsOverLit p -> HsOverLit p -> Bool

(/=) :: HsOverLit p -> HsOverLit p -> Bool

Ord (XXOverLit p) => Ord (HsOverLit p)

Defined in Language.Haskell.Syntax.Lit

Methods

compare :: HsOverLit p -> HsOverLit p -> Ordering

(<) :: HsOverLit p -> HsOverLit p -> Bool

(<=) :: HsOverLit p -> HsOverLit p -> Bool

(>) :: HsOverLit p -> HsOverLit p -> Bool

(>=) :: HsOverLit p -> HsOverLit p -> Bool

max :: HsOverLit p -> HsOverLit p -> HsOverLit p

min :: HsOverLit p -> HsOverLit p -> HsOverLit p

type Anno (HsOverLit (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (HsOverLit (GhcPass p)) = SrcSpan

data HsLit x

Haskell Literal

Constructors

HsChar (XHsChar x) Char

Character

HsCharPrim (XHsCharPrim x) Char

Unboxed character

HsString (XHsString x) FastString

String

HsStringPrim (XHsStringPrim x) !ByteString

Packed bytes

HsInt (XHsInt x) IntegralLit

Genuinely an Int; arises from GHC.Tc.Deriv.Generate, and from TRANSLATION

HsIntPrim (XHsIntPrim x) Integer

literal Int#

HsWordPrim (XHsWordPrim x) Integer

literal Word#

HsInt64Prim (XHsInt64Prim x) Integer

literal Int64#

HsWord64Prim (XHsWord64Prim x) Integer

literal Word64#

HsInteger (XHsInteger x) Integer Type

Genuinely an integer; arises only from TRANSLATION (overloaded literals are done with HsOverLit)

HsRat (XHsRat x) FractionalLit Type

Genuinely a rational; arises only from TRANSLATION (overloaded literals are done with HsOverLit)

HsFloatPrim (XHsFloatPrim x) FractionalLit

Unboxed Float

HsDoublePrim (XHsDoublePrim x) FractionalLit

Unboxed Double

XLit !(XXLit x)

Instances

Eq (HsLit x)

Defined in Language.Haskell.Syntax.Lit

Methods

(==) :: HsLit x -> HsLit x -> Bool

(/=) :: HsLit x -> HsLit x -> Bool

negateOverLitVal :: OverLitVal -> OverLitVal

hsOverLitNeedsParens :: PprPrec -> HsOverLit x -> Bool

hsOverLitNeedsParens p ol returns True if an overloaded literal ol needs to be parenthesized under precedence p.

hsLitNeedsParens :: PprPrec -> HsLit x -> Bool

hsLitNeedsParens p l returns True if a literal l needs to be parenthesized under precedence p.

type family SyntaxExpr p

Syntax Expression

SyntaxExpr is represents the function used in interpreting rebindable syntax. In the parser, we have no information to supply; in the renamer, we have the name of the function (but see Note [Monad fail : Rebindable syntax, overloaded strings] for a wrinkle) and in the type-checker we have a more elaborate structure SyntaxExprTc.

In some contexts, rebindable syntax is not implemented, and so we have constructors to represent that possibility in both the renamer and typechecker instantiations.

E.g. (>>=) is filled in before the renamer by the appropriate Name for (>>=), and then instantiated by the type checker with its type args etc

Instances

type SyntaxExpr (GhcPass p)

Defined in GHC.Hs.Expr

type SyntaxExpr (GhcPass p) = SyntaxExprGhc p

data MatchGroup p body

Constructors

MG

Fields

• mg_ext :: XMG p body
• mg_alts :: XRec p [LMatch p body]
• mg_origin :: Origin

XMatchGroup !(XXMatchGroup p body)

Instances

(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

type LHsExpr p

Arguments

 = XRec p (HsExpr p)

May have AnnKeywordId : AnnComma when in a list

Located Haskell Expression

data HsSplice id

Haskell Splice

Constructors

HsTypedSplice (XTypedSplice id) SpliceDecoration (IdP id) (LHsExpr id)

HsUntypedSplice (XUntypedSplice id) SpliceDecoration (IdP id) (LHsExpr id)

HsQuasiQuote (XQuasiQuote id) (IdP id) (IdP id) SrcSpan FastString

HsSpliced (XSpliced id) ThModFinalizers (HsSplicedThing id)

XSplice !(XXSplice id)

Instances

HiePass p => ToHie (LocatedA (HsSplice (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsSplice (GhcPass p)) -> HieM [HieAST Type]

type Anno (HsSplice (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsSplice (GhcPass p)) = SrcSpanAnnA

data HsExpr p

A Haskell expression.

Constructors

HsVar (XVar p) (LIdP p)

Variable See Note [Located RdrNames]

HsUnboundVar (XUnboundVar p) OccName

Unbound variable; also used for "holes" (_ or _x). Turned from HsVar to HsUnboundVar by the renamer, when it finds an out-of-scope variable or hole. The (XUnboundVar p) field becomes an HoleExprRef after typechecking; this is where the erroring expression will be written after solving. See Note [Holes] in GHC.Tc.Types.Constraint.

HsConLikeOut (XConLikeOut p) ConLike

After typechecker only; must be different HsVar for pretty printing

HsRecFld (XRecFld p) (AmbiguousFieldOcc p)

Variable pointing to record selector The parser produces HsVars The renamer renames record-field selectors to HsRecFld The typechecker preserves HsRecFld

HsOverLabel (XOverLabel p) FastString

Overloaded label (Note [Overloaded labels] in GHC.OverloadedLabels)

HsIPVar (XIPVar p) HsIPName

Implicit parameter (not in use after typechecking)

HsOverLit (XOverLitE p) (HsOverLit p)

Overloaded literals

HsLit (XLitE p) (HsLit p)

Simple (non-overloaded) literals

HsLam (XLam p) (MatchGroup p (LHsExpr p))

Lambda abstraction. Currently always a single match

• AnnKeywordId : AnnLam, AnnRarrow,

HsLamCase (XLamCase p) (MatchGroup p (LHsExpr p))

Lambda-case

• AnnKeywordId : AnnLam, AnnCase,AnnOpen, AnnClose

HsApp (XApp p) (LHsExpr p) (LHsExpr p)

Application

HsAppType (XAppTypeE p) (LHsExpr p) (LHsWcType (NoGhcTc p))

Visible type application

Explicit type argument; e.g f @Int x y NB: Has wildcards, but no implicit quantification

• AnnKeywordId : AnnAt,

OpApp (XOpApp p) (LHsExpr p) (LHsExpr p) (LHsExpr p)

Operator applications: NB Bracketed ops such as (+) come out as Vars.

NegApp (XNegApp p) (LHsExpr p) (SyntaxExpr p)

Negation operator. Contains the negated expression and the name of negate

• AnnKeywordId : AnnMinus

HsPar

• AnnKeywordId : AnnOpen '(', AnnClose ')'

Fields

• (XPar p)
• (LHsExpr p)

  Parenthesised expr; see Note [Parens in HsSyn]

SectionL (XSectionL p) (LHsExpr p) (LHsExpr p)

SectionR (XSectionR p) (LHsExpr p) (LHsExpr p)

ExplicitTuple (XExplicitTuple p) [HsTupArg p] Boxity

Used for explicit tuples and sections thereof

• AnnKeywordId : AnnOpen, AnnClose

ExplicitSum (XExplicitSum p) ConTag Arity (LHsExpr p)

Used for unboxed sum types

• AnnKeywordId : AnnOpen '(#', AnnVbar, AnnClose '#)',

There will be multiple AnnVbar, (1 - alternative) before the expression, (arity - alternative) after it

HsCase (XCase p) (LHsExpr p) (MatchGroup p (LHsExpr p))

• AnnKeywordId : AnnCase, AnnOf,AnnOpen '{', AnnClose '}'

HsIf (XIf p) (LHsExpr p) (LHsExpr p) (LHsExpr p)

• AnnKeywordId : AnnIf, AnnSemi, AnnThen,AnnSemi, AnnElse,

HsMultiIf (XMultiIf p) [LGRHS p (LHsExpr p)]

Multi-way if

• AnnKeywordId : AnnIf AnnOpen,AnnClose,

HsLet (XLet p) (HsLocalBinds p) (LHsExpr p)

let(rec)

• AnnKeywordId : AnnLet, AnnOpen '{', AnnClose '}',AnnIn

HsDo (XDo p) (HsStmtContext (HsDoRn p)) (XRec p [ExprLStmt p])

• AnnKeywordId : AnnDo, AnnOpen, AnnSemi, AnnVbar, AnnClose

ExplicitList (XExplicitList p) [LHsExpr p]

Syntactic list: [a,b,c,...]

• AnnKeywordId : AnnOpen '[', AnnClose ']'

RecordCon

Record construction

• AnnKeywordId : AnnOpen '{', AnnDotdot,AnnClose '}'

Fields

• rcon_ext :: XRecordCon p
• rcon_con :: XRec p (ConLikeP p)
• rcon_flds :: HsRecordBinds p

RecordUpd

Record update

• AnnKeywordId : AnnOpen '{', AnnDotdot,AnnClose '}' 'GHC.Parser.Annotation.AnnComma, AnnDot, AnnClose '}'

Fields

• rupd_ext :: XRecordUpd p
• rupd_expr :: LHsExpr p
• rupd_flds :: Either [LHsRecUpdField p] [LHsRecUpdProj p]

HsGetField

Record field selection e.g z.x.

• AnnKeywordId : AnnDot

This case only arises when the OverloadedRecordDot langauge extension is enabled.

Fields

• gf_ext :: XGetField p
• gf_expr :: LHsExpr p
• gf_field :: Located (HsFieldLabel p)

HsProjection

Record field selector. e.g. (.x) or (.x.y)

• AnnKeywordId : AnnOpenP AnnDot, AnnCloseP

This case only arises when the OverloadedRecordDot langauge extensions is enabled.

Fields

• proj_ext :: XProjection p
• proj_flds :: NonEmpty (Located (HsFieldLabel p))

ExprWithTySig (XExprWithTySig p) (LHsExpr p) (LHsSigWcType (NoGhcTc p))

Expression with an explicit type signature. e :: type

• AnnKeywordId : AnnDcolon

ArithSeq (XArithSeq p) (Maybe (SyntaxExpr p)) (ArithSeqInfo p)

Arithmetic sequence

• AnnKeywordId : AnnOpen '[', AnnComma,AnnDotdot, AnnClose ']'

HsBracket (XBracket p) (HsBracket p)

• AnnKeywordId : AnnOpen, AnnOpenE,AnnOpenEQ, AnnClose,AnnCloseQ

HsRnBracketOut (XRnBracketOut p) (HsBracket (HsBracketRn p)) [PendingRnSplice' p]

HsTcBracketOut (XTcBracketOut p) (Maybe QuoteWrapper) (HsBracket (HsBracketRn p)) [PendingTcSplice' p]

HsSpliceE (XSpliceE p) (HsSplice p)

• AnnKeywordId : AnnOpen, AnnClose

HsProc (XProc p) (LPat p) (LHsCmdTop p)

proc notation for Arrows

• AnnKeywordId : AnnProc, AnnRarrow

HsStatic (XStatic p) (LHsExpr p)

• AnnKeywordId : AnnStatic,

HsTick (XTick p) CoreTickish (LHsExpr p)

HsBinTick (XBinTick p) Int Int (LHsExpr p)

HsPragE (XPragE p) (HsPragE p) (LHsExpr p)

XExpr !(XXExpr p)

Instances

DisambECP (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

Associated Types

type Body (HsExpr GhcPs) :: Type -> Type

type InfixOp (HsExpr GhcPs)

type FunArg (HsExpr GhcPs)

Methods

ecpFromCmd' :: LHsCmd GhcPs -> PV (LocatedA (HsExpr GhcPs))

ecpFromExp' :: LHsExpr GhcPs -> PV (LocatedA (HsExpr GhcPs))

mkHsProjUpdatePV :: SrcSpan -> Located [Located (HsFieldLabel GhcPs)] -> LocatedA (HsExpr GhcPs) -> Bool -> [AddEpAnn] -> PV (LHsRecProj GhcPs (LocatedA (HsExpr GhcPs)))

mkHsLamPV :: SrcSpan -> (EpAnnComments -> MatchGroup GhcPs (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs))

mkHsLetPV :: SrcSpan -> HsLocalBinds GhcPs -> LocatedA (HsExpr GhcPs) -> AnnsLet -> PV (LocatedA (HsExpr GhcPs))

superInfixOp :: (DisambInfixOp (InfixOp (HsExpr GhcPs)) => PV (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs))

mkHsOpAppPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> LocatedN (InfixOp (HsExpr GhcPs)) -> LocatedA (HsExpr GhcPs) -> PV (LocatedA (HsExpr GhcPs))

mkHsCasePV :: SrcSpan -> LHsExpr GhcPs -> LocatedL [LMatch GhcPs (LocatedA (HsExpr GhcPs))] -> EpAnnHsCase -> PV (LocatedA (HsExpr GhcPs))

mkHsLamCasePV :: SrcSpan -> LocatedL [LMatch GhcPs (LocatedA (HsExpr GhcPs))] -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

superFunArg :: (DisambECP (FunArg (HsExpr GhcPs)) => PV (LocatedA (HsExpr GhcPs))) -> PV (LocatedA (HsExpr GhcPs))

mkHsAppPV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LocatedA (FunArg (HsExpr GhcPs)) -> PV (LocatedA (HsExpr GhcPs))

mkHsAppTypePV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> SrcSpan -> LHsType GhcPs -> PV (LocatedA (HsExpr GhcPs))

mkHsIfPV :: SrcSpan -> LHsExpr GhcPs -> Bool -> LocatedA (HsExpr GhcPs) -> Bool -> LocatedA (HsExpr GhcPs) -> AnnsIf -> PV (LocatedA (HsExpr GhcPs))

mkHsDoPV :: SrcSpan -> Maybe ModuleName -> LocatedL [LStmt GhcPs (LocatedA (HsExpr GhcPs))] -> AnnList -> PV (LocatedA (HsExpr GhcPs))

mkHsParPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> AnnParen -> PV (LocatedA (HsExpr GhcPs))

mkHsVarPV :: LocatedN RdrName -> PV (LocatedA (HsExpr GhcPs))

mkHsLitPV :: Located (HsLit GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsOverLitPV :: Located (HsOverLit GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsWildCardPV :: SrcSpan -> PV (Located (HsExpr GhcPs))

mkHsTySigPV :: SrcSpanAnnA -> LocatedA (HsExpr GhcPs) -> LHsType GhcPs -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsExplicitListPV :: SrcSpan -> [LocatedA (HsExpr GhcPs)] -> AnnList -> PV (LocatedA (HsExpr GhcPs))

mkHsSplicePV :: Located (HsSplice GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsRecordPV :: Bool -> SrcSpan -> SrcSpan -> LocatedA (HsExpr GhcPs) -> ([Fbind (HsExpr GhcPs)], Maybe SrcSpan) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsNegAppPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsSectionR_PV :: SrcSpan -> LocatedA (InfixOp (HsExpr GhcPs)) -> LocatedA (HsExpr GhcPs) -> PV (Located (HsExpr GhcPs))

mkHsViewPatPV :: SrcSpan -> LHsExpr GhcPs -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsAsPatPV :: SrcSpan -> LocatedN RdrName -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsLazyPatPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkHsBangPatPV :: SrcSpan -> LocatedA (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

mkSumOrTuplePV :: SrcSpanAnnA -> Boxity -> SumOrTuple (HsExpr GhcPs) -> [AddEpAnn] -> PV (LocatedA (HsExpr GhcPs))

rejectPragmaPV :: LocatedA (HsExpr GhcPs) -> PV ()

DisambInfixOp (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

Methods

mkHsVarOpPV :: LocatedN RdrName -> PV (LocatedN (HsExpr GhcPs))

mkHsConOpPV :: LocatedN RdrName -> PV (LocatedN (HsExpr GhcPs))

mkHsInfixHolePV :: SrcSpan -> (EpAnnComments -> EpAnn EpAnnUnboundVar) -> PV (Located (HsExpr GhcPs))

HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))

This instance tries to construct HieAST nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs.

HsApp, for example, doesn't have any type information available directly on the node. Our next recourse would be to desugar it into a CoreExpr then query the type of that. Yet both the desugaring call and the type query both involve recursive calls to the function and argument! This is particularly problematic when you realize that the HIE traversal will eventually visit those nodes too and ask for their types again.

Since the above is quite costly, we just skip cases where computing the expression's type is going to be expensive.

See #16233

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

type Body (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type Body (HsExpr GhcPs) = HsExpr

type FunArg (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type FunArg (HsExpr GhcPs) = HsExpr GhcPs

type InfixOp (HsExpr GhcPs)

Defined in GHC.Parser.PostProcess

type InfixOp (HsExpr GhcPs) = HsExpr GhcPs

type Anno (HsExpr (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

data GRHSs p body

Guarded Right-Hand Sides

GRHSs are used both for pattern bindings and for Matches

• AnnKeywordId : AnnVbar, AnnEqual,AnnWhere, AnnOpen,AnnClose AnnRarrow,AnnSemi

Constructors

GRHSs

Fields

• grhssExt :: XCGRHSs p body
• grhssGRHSs :: [LGRHS p body]

  Guarded RHSs

• grhssLocalBinds :: HsLocalBinds p

  The where clause

XGRHSs !(XXGRHSs p body)

Instances

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

type family XXWarnDecls x

Instances

type XXWarnDecls (GhcPass _1)

Defined in GHC.Hs.Decls

type XXWarnDecls (GhcPass _1) = NoExtCon

type family XXWarnDecl x

Instances

type XXWarnDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXWarnDecl (GhcPass _1) = NoExtCon

type family XXValBindsLR x x'

Instances

type XXValBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXValBindsLR (GhcPass pL) (GhcPass pR) = NHsValBindsLR (GhcPass pL)

type family XXType x

Instances

type XXType (GhcPass _1)

Defined in GHC.Hs.Type

type XXType (GhcPass _1) = HsCoreTy

type family XXTyVarBndr x

Instances

type XXTyVarBndr (GhcPass _1)

Defined in GHC.Hs.Type

type XXTyVarBndr (GhcPass _1) = NoExtCon

type family XXTyFamInstDecl x

Instances

type XXTyFamInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyFamInstDecl (GhcPass _1) = NoExtCon

type family XXTyClGroup x

Instances

type XXTyClGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyClGroup (GhcPass _1) = NoExtCon

type family XXTyClDecl x

Instances

type XXTyClDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXTyClDecl (GhcPass _1) = NoExtCon

type family XXTupArg x

Instances

type XXTupArg (GhcPass _1)

Defined in GHC.Hs.Expr

type XXTupArg (GhcPass _1) = NoExtCon

type family XXStmtLR x x' b

Instances

type XXStmtLR (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XXStmtLR (GhcPass _1) (GhcPass _2) b = NoExtCon

type family XXStandaloneKindSig x

Instances

type XXStandaloneKindSig (GhcPass p)

Defined in GHC.Hs.Decls

type XXStandaloneKindSig (GhcPass p) = NoExtCon

type family XXSpliceDecl x

Instances

type XXSpliceDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXSpliceDecl (GhcPass _1) = NoExtCon

type family XXSplice x

Instances

type XXSplice GhcPs

Defined in GHC.Hs.Expr

type XXSplice GhcPs = NoExtCon

type XXSplice GhcRn

Defined in GHC.Hs.Expr

type XXSplice GhcRn = NoExtCon

type XXSplice GhcTc

Defined in GHC.Hs.Expr

type XXSplice GhcTc = HsSplicedT

type family XXSig x

Instances

type XXSig (GhcPass p)

Defined in GHC.Hs.Binds

type XXSig (GhcPass p) = NoExtCon

type family XXRuleDecls x

Instances

type XXRuleDecls (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleDecls (GhcPass _1) = NoExtCon

type family XXRuleDecl x

Instances

type XXRuleDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleDecl (GhcPass _1) = NoExtCon

type family XXRuleBndr x

Instances

type XXRuleBndr (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRuleBndr (GhcPass _1) = NoExtCon

type family XXRoleAnnotDecl x

Instances

type XXRoleAnnotDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXRoleAnnotDecl (GhcPass _1) = NoExtCon

type family XXPragE x

Instances

type XXPragE (GhcPass _1)

Defined in GHC.Hs.Expr

type XXPragE (GhcPass _1) = NoExtCon

type family XXPatSynBind x x'

Instances

type XXPatSynBind (GhcPass idL) (GhcPass idR)

Defined in GHC.Hs.Binds

type XXPatSynBind (GhcPass idL) (GhcPass idR) = NoExtCon

type family XXPat x

Instances

type XXPat GhcPs

Defined in GHC.Hs.Pat

type XXPat GhcPs = NoExtCon

type XXPat GhcRn

Defined in GHC.Hs.Pat

type XXPat GhcRn = NoExtCon

type XXPat GhcTc

Defined in GHC.Hs.Pat

type XXPat GhcTc = CoPat

type family XXParStmtBlock x x'

Instances

type XXParStmtBlock (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Expr

type XXParStmtBlock (GhcPass pL) (GhcPass pR) = NoExtCon

type family XXOverLit x

Instances

type XXOverLit (GhcPass _1)

Defined in GHC.Hs.Lit

type XXOverLit (GhcPass _1) = NoExtCon

type family XXMatchGroup x b

Instances

type XXMatchGroup (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXMatchGroup (GhcPass _1) b = NoExtCon

type family XXMatch x b

Instances

type XXMatch (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXMatch (GhcPass _1) b = NoExtCon

type family XXLit x

Instances

type XXLit (GhcPass _1)

Defined in GHC.Hs.Lit

type XXLit (GhcPass _1) = NoExtCon

type family XXLHsQTyVars x

Instances

type XXLHsQTyVars (GhcPass _1)

Defined in GHC.Hs.Type

type XXLHsQTyVars (GhcPass _1) = NoExtCon

type family XXInstDecl x

Instances

type XXInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXInstDecl (GhcPass _1) = NoExtCon

type family XXInjectivityAnn x

Instances

type XXInjectivityAnn (GhcPass _1)

Defined in GHC.Hs.Decls

type XXInjectivityAnn (GhcPass _1) = NoExtCon

type family XXImportDecl x

Instances

type XXImportDecl (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XXImportDecl (GhcPass _1) = NoExtCon

type family XXIPBind x

Instances

type XXIPBind (GhcPass p)

Defined in GHC.Hs.Binds

type XXIPBind (GhcPass p) = NoExtCon

type family XXIE x

Instances

type XXIE (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XXIE (GhcPass _1) = NoExtCon

type family XXHsWildCardBndrs x b

Instances

type XXHsWildCardBndrs (GhcPass _1) _2

Defined in GHC.Hs.Type

type XXHsWildCardBndrs (GhcPass _1) _2 = NoExtCon

type family XXHsSigType x

Instances

type XXHsSigType (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsSigType (GhcPass _1) = NoExtCon

type family XXHsPatSigType x

Instances

type XXHsPatSigType (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsPatSigType (GhcPass _1) = NoExtCon

type family XXHsOuterTyVarBndrs x

Instances

type XXHsOuterTyVarBndrs (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsOuterTyVarBndrs (GhcPass _1) = NoExtCon

type family XXHsLocalBindsLR x x'

Instances

type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXHsLocalBindsLR (GhcPass pL) (GhcPass pR) = NoExtCon

type family XXHsIPBinds x

Instances

type XXHsIPBinds (GhcPass p)

Defined in GHC.Hs.Binds

type XXHsIPBinds (GhcPass p) = NoExtCon

type family XXHsGroup x

Instances

type XXHsGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsGroup (GhcPass _1) = NoExtCon

type family XXHsForAllTelescope x

Instances

type XXHsForAllTelescope (GhcPass _1)

Defined in GHC.Hs.Type

type XXHsForAllTelescope (GhcPass _1) = NoExtCon

type family XXHsFieldLabel x

Instances

type XXHsFieldLabel (GhcPass _1)

Defined in GHC.Hs.Expr

type XXHsFieldLabel (GhcPass _1) = NoExtCon

type family XXHsDerivingClause x

Instances

type XXHsDerivingClause (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDerivingClause (GhcPass _1) = NoExtCon

type family XXHsDecl x

Instances

type XXHsDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDecl (GhcPass _1) = NoExtCon

type family XXHsDataDefn x

Instances

type XXHsDataDefn (GhcPass _1)

Defined in GHC.Hs.Decls

type XXHsDataDefn (GhcPass _1) = NoExtCon

type family XXHsBindsLR x x'

Instances

type XXHsBindsLR (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XXHsBindsLR (GhcPass pL) (GhcPass pR) = NoExtCon

type family XXGRHSs x b

Instances

type XXGRHSs (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XXGRHSs (GhcPass _1) _2 = NoExtCon

type family XXGRHS x b

Instances

type XXGRHS (GhcPass _1) b

Defined in GHC.Hs.Expr

type XXGRHS (GhcPass _1) b = NoExtCon

type family XXFunDep x

Instances

type XXFunDep (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFunDep (GhcPass _1) = NoExtCon

type family XXForeignDecl x

Instances

type XXForeignDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXForeignDecl (GhcPass _1) = NoExtCon

type family XXFixitySig x

Instances

type XXFixitySig (GhcPass p)

Defined in GHC.Hs.Binds

type XXFixitySig (GhcPass p) = NoExtCon

type family XXFieldOcc x

Instances

type XXFieldOcc (GhcPass _1)

Defined in GHC.Hs.Type

type XXFieldOcc (GhcPass _1) = NoExtCon

type family XXFamilyResultSig x

Instances

type XXFamilyResultSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFamilyResultSig (GhcPass _1) = NoExtCon

type family XXFamilyDecl x

Instances

type XXFamilyDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXFamilyDecl (GhcPass _1) = NoExtCon

type family XXFamEqn x r

Instances

type XXFamEqn (GhcPass _1) r

Defined in GHC.Hs.Decls

type XXFamEqn (GhcPass _1) r = NoExtCon

type family XXExpr x

Instances

type XXExpr GhcPs

Defined in GHC.Hs.Expr

type XXExpr GhcPs = NoExtCon

type XXExpr GhcRn

Defined in GHC.Hs.Expr

type XXExpr GhcRn = HsExpansion (HsExpr GhcRn) (HsExpr GhcRn)

type XXExpr GhcTc

Defined in GHC.Hs.Expr

type XXExpr GhcTc = XXExprGhcTc

type family XXDerivDecl x

Instances

type XXDerivDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDerivDecl (GhcPass _1) = NoExtCon

type family XXDerivClauseTys x

Instances

type XXDerivClauseTys (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDerivClauseTys (GhcPass _1) = NoExtCon

type family XXDefaultDecl x

Instances

type XXDefaultDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXDefaultDecl (GhcPass _1) = NoExtCon

type family XXConDeclField x

Instances

type XXConDeclField (GhcPass _1)

Defined in GHC.Hs.Type

type XXConDeclField (GhcPass _1) = NoExtCon

type family XXConDecl x

Instances

type XXConDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXConDecl (GhcPass _1) = NoExtCon

type family XXCmdTop x

Instances

type XXCmdTop (GhcPass _1)

Defined in GHC.Hs.Expr

type XXCmdTop (GhcPass _1) = NoExtCon

type family XXCmd x

Instances

type XXCmd GhcPs

Defined in GHC.Hs.Expr

type XXCmd GhcPs = NoExtCon

type XXCmd GhcRn

Defined in GHC.Hs.Expr

type XXCmd GhcRn = NoExtCon

type XXCmd GhcTc

Defined in GHC.Hs.Expr

type XXCmd GhcTc = HsWrap HsCmd

type family XXClsInstDecl x

Instances

type XXClsInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXClsInstDecl (GhcPass _1) = NoExtCon

type family XXBracket x

Instances

type XXBracket (GhcPass _1)

Defined in GHC.Hs.Expr

type XXBracket (GhcPass _1) = NoExtCon

type family XXApplicativeArg x

Instances

type XXApplicativeArg (GhcPass _1)

Defined in GHC.Hs.Expr

type XXApplicativeArg (GhcPass _1) = NoExtCon

type family XXAnnDecl x

Instances

type XXAnnDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XXAnnDecl (GhcPass _1) = NoExtCon

type family XXAmbiguousFieldOcc x

Instances

type XXAmbiguousFieldOcc (GhcPass _1)

Defined in GHC.Hs.Type

type XXAmbiguousFieldOcc (GhcPass _1) = NoExtCon

type family XXABExport x

Instances

type XXABExport (GhcPass p)

Defined in GHC.Hs.Binds

type XXABExport (GhcPass p) = NoExtCon

type family XWildPat x

Instances

type XWildPat GhcPs

Defined in GHC.Hs.Pat

type XWildPat GhcPs = NoExtField

type XWildPat GhcRn

Defined in GHC.Hs.Pat

type XWildPat GhcRn = NoExtField

type XWildPat GhcTc

Defined in GHC.Hs.Pat

type XWildPat GhcTc = Type

type family XWildCardTy x

Instances

type XWildCardTy (GhcPass _1)

Defined in GHC.Hs.Type

type XWildCardTy (GhcPass _1) = NoExtField

type family XWarnings x

Instances

type XWarnings GhcPs

Defined in GHC.Hs.Decls

type XWarnings GhcPs = EpAnn [AddEpAnn]

type XWarnings GhcRn

Defined in GHC.Hs.Decls

type XWarnings GhcRn = NoExtField

type XWarnings GhcTc

Defined in GHC.Hs.Decls

type XWarnings GhcTc = NoExtField

type family XWarningD x

Instances

type XWarningD (GhcPass _1)

Defined in GHC.Hs.Decls

type XWarningD (GhcPass _1) = NoExtField

type family XWarning x

Instances

type XWarning (GhcPass _1)

Defined in GHC.Hs.Decls

type XWarning (GhcPass _1) = EpAnn [AddEpAnn]

type family XViewPat x

Instances

type XViewPat GhcPs

Defined in GHC.Hs.Pat

type XViewPat GhcPs = EpAnn [AddEpAnn]

type XViewPat GhcRn

Defined in GHC.Hs.Pat

type XViewPat GhcRn = NoExtField

type XViewPat GhcTc

Defined in GHC.Hs.Pat

type XViewPat GhcTc = Type

type family XViaStrategy x

Instances

type XViaStrategy GhcPs

Defined in GHC.Hs.Decls

type XViaStrategy GhcPs = XViaStrategyPs

type XViaStrategy GhcRn

Defined in GHC.Hs.Decls

type XViaStrategy GhcRn = LHsSigType GhcRn

type XViaStrategy GhcTc

Defined in GHC.Hs.Decls

type XViaStrategy GhcTc = Type

type family XVarPat x

Instances

type XVarPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XVarPat (GhcPass _1) = NoExtField

type family XVarBr x

Instances

type XVarBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XVarBr (GhcPass _1) = NoExtField

type family XVarBind x x'

Instances

type XVarBind (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XVarBind (GhcPass pL) (GhcPass pR) = NoExtField

type family XVar x

Instances

type XVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XVar (GhcPass _1) = NoExtField

type XVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XVar (GhcPass _1) = NoExtField

type family XValD x

Instances

type XValD (GhcPass _1)

Defined in GHC.Hs.Decls

type XValD (GhcPass _1) = NoExtField

type family XValBinds x x'

Instances

type XValBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XValBinds (GhcPass pL) (GhcPass pR) = AnnSortKey

type family XUserTyVar x

Instances

type XUserTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XUserTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XUntypedSplice x

Instances

type XUntypedSplice (GhcPass _1)

Defined in GHC.Hs.Expr

type XUntypedSplice (GhcPass _1) = EpAnn [AddEpAnn]

type family XUnboundVar x

Instances

type XUnboundVar GhcPs

Defined in GHC.Hs.Expr

type XUnboundVar GhcPs = EpAnn EpAnnUnboundVar

type XUnboundVar GhcRn

Defined in GHC.Hs.Expr

type XUnboundVar GhcRn = NoExtField

type XUnboundVar GhcTc

Defined in GHC.Hs.Expr

type XUnboundVar GhcTc = HoleExprRef

type family XUnambiguous x

Instances

type XUnambiguous GhcPs

Defined in GHC.Hs.Type

type XUnambiguous GhcPs = NoExtField

type XUnambiguous GhcRn

Defined in GHC.Hs.Type

type XUnambiguous GhcRn = Name

type XUnambiguous GhcTc

Defined in GHC.Hs.Type

type XUnambiguous GhcTc = Id

type family XTypedSplice x

Instances

type XTypedSplice (GhcPass _1)

Defined in GHC.Hs.Expr

type XTypedSplice (GhcPass _1) = EpAnn [AddEpAnn]

type family XTypeSig x

Instances

type XTypeSig (GhcPass p)

Defined in GHC.Hs.Binds

type XTypeSig (GhcPass p) = EpAnn AnnSig

type family XTypBr x

Instances

type XTypBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XTypBr (GhcPass _1) = NoExtField

type family XTyVarSig x

Instances

type XTyVarSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XTyVarSig (GhcPass _1) = NoExtField

type family XTyVar x

Instances

type XTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XTyLit x

Instances

type XTyLit (GhcPass _1)

Defined in GHC.Hs.Type

type XTyLit (GhcPass _1) = NoExtField

type family XTyFamInstD x

Instances

type XTyFamInstD GhcPs

Defined in GHC.Hs.Decls

type XTyFamInstD GhcPs = NoExtField

type XTyFamInstD GhcRn

Defined in GHC.Hs.Decls

type XTyFamInstD GhcRn = NoExtField

type XTyFamInstD GhcTc

Defined in GHC.Hs.Decls

type XTyFamInstD GhcTc = NoExtField

type family XTyClD x

Instances

type XTyClD (GhcPass _1)

Defined in GHC.Hs.Decls

type XTyClD (GhcPass _1) = NoExtField

type family XTupleTy x

Instances

type XTupleTy (GhcPass _1)

Defined in GHC.Hs.Type

type XTupleTy (GhcPass _1) = EpAnn AnnParen

type family XTuplePat x

Instances

type XTuplePat GhcPs

Defined in GHC.Hs.Pat

type XTuplePat GhcPs = EpAnn [AddEpAnn]

type XTuplePat GhcRn

Defined in GHC.Hs.Pat

type XTuplePat GhcRn = NoExtField

type XTuplePat GhcTc

Defined in GHC.Hs.Pat

type XTuplePat GhcTc = [Type]

type family XTransStmt x x' b

Instances

type XTransStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]

type XTransStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcRn b = NoExtField

type XTransStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XTransStmt (GhcPass _1) GhcTc b = Type

type family XTick x

Instances

type XTick (GhcPass _1)

Defined in GHC.Hs.Expr

type XTick (GhcPass _1) = NoExtField

type family XTcBracketOut x

Instances

type XTcBracketOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XTcBracketOut (GhcPass _1) = NoExtField

type family XTExpBr x

Instances

type XTExpBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XTExpBr (GhcPass _1) = NoExtField

type family XSynDecl x

Instances

type XSynDecl GhcPs

Defined in GHC.Hs.Decls

type XSynDecl GhcPs = EpAnn [AddEpAnn]

type XSynDecl GhcRn

Defined in GHC.Hs.Decls

type XSynDecl GhcRn = NameSet

type XSynDecl GhcTc

Defined in GHC.Hs.Decls

type XSynDecl GhcTc = NameSet

type family XSumTy x

Instances

type XSumTy (GhcPass _1)

Defined in GHC.Hs.Type

type XSumTy (GhcPass _1) = EpAnn AnnParen

type family XSumPat x

Instances

type XSumPat GhcPs

Defined in GHC.Hs.Pat

type XSumPat GhcPs = EpAnn EpAnnSumPat

type XSumPat GhcRn

Defined in GHC.Hs.Pat

type XSumPat GhcRn = NoExtField

type XSumPat GhcTc

Defined in GHC.Hs.Pat

type XSumPat GhcTc = [Type]

type family XStockStrategy x

Instances

type XStockStrategy GhcPs

Defined in GHC.Hs.Decls

type XStockStrategy GhcPs = EpAnn [AddEpAnn]

type XStockStrategy GhcRn

Defined in GHC.Hs.Decls

type XStockStrategy GhcRn = NoExtField

type XStockStrategy GhcTc

Defined in GHC.Hs.Decls

type XStockStrategy GhcTc = NoExtField

type family XStatic x

Instances

type XStatic GhcPs

Defined in GHC.Hs.Expr

type XStatic GhcPs = EpAnn [AddEpAnn]

type XStatic GhcRn

Defined in GHC.Hs.Expr

type XStatic GhcRn = NameSet

type XStatic GhcTc

Defined in GHC.Hs.Expr

type XStatic GhcTc = NameSet

type family XStarTy x

Instances

type XStarTy (GhcPass _1)

Defined in GHC.Hs.Type

type XStarTy (GhcPass _1) = NoExtField

type family XStandaloneKindSig x

Instances

type XStandaloneKindSig GhcPs

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcPs = EpAnn [AddEpAnn]

type XStandaloneKindSig GhcRn

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcRn = NoExtField

type XStandaloneKindSig GhcTc

Defined in GHC.Hs.Decls

type XStandaloneKindSig GhcTc = NoExtField

type family XSpliced x

Instances

type XSpliced (GhcPass _1)

Defined in GHC.Hs.Expr

type XSpliced (GhcPass _1) = NoExtField

type family XSpliceTy x

Instances

type XSpliceTy GhcPs

Defined in GHC.Hs.Type

type XSpliceTy GhcPs = NoExtField

type XSpliceTy GhcRn

Defined in GHC.Hs.Type

type XSpliceTy GhcRn = NoExtField

type XSpliceTy GhcTc

Defined in GHC.Hs.Type

type XSpliceTy GhcTc = Kind

type family XSplicePat x

Instances

type XSplicePat (GhcPass _1)

Defined in GHC.Hs.Pat

type XSplicePat (GhcPass _1) = NoExtField

type family XSpliceE x

Instances

type XSpliceE (GhcPass _1)

Defined in GHC.Hs.Expr

type XSpliceE (GhcPass _1) = EpAnnCO

type family XSpliceDecl x

Instances

type XSpliceDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XSpliceDecl (GhcPass _1) = NoExtField

type family XSpliceD x

Instances

type XSpliceD (GhcPass _1)

Defined in GHC.Hs.Decls

type XSpliceD (GhcPass _1) = NoExtField

type family XSpecSig x

Instances

type XSpecSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSpecSig (GhcPass p) = EpAnn [AddEpAnn]

type family XSpecInstSig x

Instances

type XSpecInstSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSpecInstSig (GhcPass p) = EpAnn [AddEpAnn]

type family XSigPat x

Instances

type XSigPat GhcPs

Defined in GHC.Hs.Pat

type XSigPat GhcPs = EpAnn [AddEpAnn]

type XSigPat GhcRn

Defined in GHC.Hs.Pat

type XSigPat GhcRn = NoExtField

type XSigPat GhcTc

Defined in GHC.Hs.Pat

type XSigPat GhcTc = Type

type family XSigD x

Instances

type XSigD (GhcPass _1)

Defined in GHC.Hs.Decls

type XSigD (GhcPass _1) = NoExtField

type family XSectionR x

Instances

type XSectionR GhcPs

Defined in GHC.Hs.Expr

type XSectionR GhcPs = EpAnnCO

type XSectionR GhcRn

Defined in GHC.Hs.Expr

type XSectionR GhcRn = EpAnnCO

type XSectionR GhcTc

Defined in GHC.Hs.Expr

type XSectionR GhcTc = Void

type family XSectionL x

Instances

type XSectionL GhcPs

Defined in GHC.Hs.Expr

type XSectionL GhcPs = EpAnnCO

type XSectionL GhcRn

Defined in GHC.Hs.Expr

type XSectionL GhcRn = EpAnnCO

type XSectionL GhcTc

Defined in GHC.Hs.Expr

type XSectionL GhcTc = Void

type family XSCCFunSig x

Instances

type XSCCFunSig (GhcPass p)

Defined in GHC.Hs.Binds

type XSCCFunSig (GhcPass p) = EpAnn [AddEpAnn]

type family XSCC x

Instances

type XSCC (GhcPass _1)

Defined in GHC.Hs.Expr

type XSCC (GhcPass _1) = EpAnn AnnPragma

type family XRuleD x

Instances

type XRuleD (GhcPass _1)

Defined in GHC.Hs.Decls

type XRuleD (GhcPass _1) = NoExtField

type family XRuleBndrSig x

Instances

type XRuleBndrSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XRuleBndrSig (GhcPass _1) = EpAnn [AddEpAnn]

type family XRoleAnnotD x

Instances

type XRoleAnnotD (GhcPass _1)

Defined in GHC.Hs.Decls

type XRoleAnnotD (GhcPass _1) = NoExtField

type family XRnBracketOut x

Instances

type XRnBracketOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XRnBracketOut (GhcPass _1) = NoExtField

type family XRecordUpd x

Instances

type XRecordUpd GhcPs

Defined in GHC.Hs.Expr

type XRecordUpd GhcPs = EpAnn [AddEpAnn]

type XRecordUpd GhcRn

Defined in GHC.Hs.Expr

type XRecordUpd GhcRn = NoExtField

type XRecordUpd GhcTc

Defined in GHC.Hs.Expr

type XRecordUpd GhcTc = RecordUpdTc

type family XRecordCon x

Instances

type XRecordCon GhcPs

Defined in GHC.Hs.Expr

type XRecordCon GhcPs = EpAnn [AddEpAnn]

type XRecordCon GhcRn

Defined in GHC.Hs.Expr

type XRecordCon GhcRn = NoExtField

type XRecordCon GhcTc

Defined in GHC.Hs.Expr

type XRecordCon GhcTc = PostTcExpr

type family XRecTy x

Instances

type XRecTy GhcPs

Defined in GHC.Hs.Type

type XRecTy GhcPs = EpAnn AnnList

type XRecTy GhcRn

Defined in GHC.Hs.Type

type XRecTy GhcRn = NoExtField

type XRecTy GhcTc

Defined in GHC.Hs.Type

type XRecTy GhcTc = NoExtField

type family XRecStmt x x' b

Instances

type XRecStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcPs b = EpAnn AnnList

type XRecStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcRn b = NoExtField

type XRecStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XRecStmt (GhcPass _1) GhcTc b = RecStmtTc

type family XRecFld x

Instances

type XRecFld (GhcPass _1)

Defined in GHC.Hs.Expr

type XRecFld (GhcPass _1) = NoExtField

type XRecFld (GhcPass _1)

Defined in GHC.Hs.Expr

type XRecFld (GhcPass _1) = NoExtField

type family XRec p a = (r :: Type) | r -> a

GHC's L prefixed variants wrap their vanilla variant in this type family, to add SrcLoc info via Located. Other passes than GhcPass not interested in location information can define this as type instance XRec NoLocated a = a. See Note [XRec and SrcSpans in the AST]

Instances

type XRec (GhcPass p) a

Defined in GHC.Hs.Extension

type XRec (GhcPass p) a = GenLocated (Anno a) a

type family XQuasiQuote x

Instances

type XQuasiQuote (GhcPass _1)

Defined in GHC.Hs.Expr

type XQuasiQuote (GhcPass _1) = NoExtField

type family XQualTy x

Instances

type XQualTy (GhcPass _1)

Defined in GHC.Hs.Type

type XQualTy (GhcPass _1) = NoExtField

type family XProjection x

Instances

type XProjection GhcPs

Defined in GHC.Hs.Expr

type XProjection GhcPs = EpAnn AnnProjection

type XProjection GhcRn

Defined in GHC.Hs.Expr

type XProjection GhcRn = NoExtField

type XProjection GhcTc

Defined in GHC.Hs.Expr

type XProjection GhcTc = Void

type family XProc x

Instances

type XProc (GhcPass _1)

Defined in GHC.Hs.Expr

type XProc (GhcPass _1) = EpAnn [AddEpAnn]

type family XPresent x

Instances

type XPresent (GhcPass _1)

Defined in GHC.Hs.Expr

type XPresent (GhcPass _1) = EpAnn [AddEpAnn]

type family XPragE x

Instances

type XPragE (GhcPass _1)

Defined in GHC.Hs.Expr

type XPragE (GhcPass _1) = NoExtField

type family XPatSynSig x

Instances

type XPatSynSig (GhcPass p)

Defined in GHC.Hs.Binds

type XPatSynSig (GhcPass p) = EpAnn AnnSig

type family XPatSynBind x x'

Instances

type XPatSynBind (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatSynBind (GhcPass pL) (GhcPass pR) = NoExtField

type family XPatBr x

Instances

type XPatBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XPatBr (GhcPass _1) = NoExtField

type family XPatBind x x'

Instances

type XPatBind GhcPs (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcPs (GhcPass pR) = EpAnn [AddEpAnn]

type XPatBind GhcRn (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcRn (GhcPass pR) = NameSet

type XPatBind GhcTc (GhcPass pR)

Defined in GHC.Hs.Binds

type XPatBind GhcTc (GhcPass pR) = Type

type family XParTy x

Instances

type XParTy (GhcPass _1)

Defined in GHC.Hs.Type

type XParTy (GhcPass _1) = EpAnn AnnParen

type family XParStmtBlock x x'

Instances

type XParStmtBlock (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Expr

type XParStmtBlock (GhcPass pL) (GhcPass pR) = NoExtField

type family XParStmt x x' b

Instances

type XParStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcPs b = NoExtField

type XParStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcRn b = NoExtField

type XParStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XParStmt (GhcPass _1) GhcTc b = Type

type family XParPat x

Instances

type XParPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XParPat (GhcPass _1) = EpAnn AnnParen

type family XPar x

Instances

type XPar (GhcPass _1)

Defined in GHC.Hs.Expr

type XPar (GhcPass _1) = EpAnn AnnParen

type family XPSB x x'

Instances

type XPSB (GhcPass idL) GhcPs

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcPs = EpAnn [AddEpAnn]

type XPSB (GhcPass idL) GhcRn

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcRn = NameSet

type XPSB (GhcPass idL) GhcTc

Defined in GHC.Hs.Binds

type XPSB (GhcPass idL) GhcTc = NameSet

type family XOverLitE x

Instances

type XOverLitE (GhcPass _1)

Defined in GHC.Hs.Expr

type XOverLitE (GhcPass _1) = EpAnnCO

type family XOverLit x

Instances

type XOverLit GhcPs

Defined in GHC.Hs.Lit

type XOverLit GhcPs = NoExtField

type XOverLit GhcRn

Defined in GHC.Hs.Lit

type XOverLit GhcRn = Bool

type XOverLit GhcTc

Defined in GHC.Hs.Lit

type XOverLit GhcTc = OverLitTc

type family XOverLabel x

Instances

type XOverLabel GhcPs

Defined in GHC.Hs.Expr

type XOverLabel GhcPs = EpAnnCO

type XOverLabel GhcRn

Defined in GHC.Hs.Expr

type XOverLabel GhcRn = EpAnnCO

type XOverLabel GhcTc

Defined in GHC.Hs.Expr

type XOverLabel GhcTc = Void

type family XOpTy x

Instances

type XOpTy (GhcPass _1)

Defined in GHC.Hs.Type

type XOpTy (GhcPass _1) = NoExtField

type family XOpApp x

Instances

type XOpApp GhcPs

Defined in GHC.Hs.Expr

type XOpApp GhcPs = EpAnn [AddEpAnn]

type XOpApp GhcRn

Defined in GHC.Hs.Expr

type XOpApp GhcRn = Fixity

type XOpApp GhcTc

Defined in GHC.Hs.Expr

type XOpApp GhcTc = Void

type family XNoSig x

Instances

type XNoSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XNoSig (GhcPass _1) = NoExtField

type family XNewtypeStrategy x

Instances

type XNewtypeStrategy GhcPs

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcPs = EpAnn [AddEpAnn]

type XNewtypeStrategy GhcRn

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcRn = NoExtField

type XNewtypeStrategy GhcTc

Defined in GHC.Hs.Decls

type XNewtypeStrategy GhcTc = NoExtField

type family XNegApp x

Instances

type XNegApp GhcPs

Defined in GHC.Hs.Expr

type XNegApp GhcPs = EpAnn [AddEpAnn]

type XNegApp GhcRn

Defined in GHC.Hs.Expr

type XNegApp GhcRn = NoExtField

type XNegApp GhcTc

Defined in GHC.Hs.Expr

type XNegApp GhcTc = NoExtField

type family XNPlusKPat x

Instances

type XNPlusKPat GhcPs

Defined in GHC.Hs.Pat

type XNPlusKPat GhcPs = EpAnn EpaLocation

type XNPlusKPat GhcRn

Defined in GHC.Hs.Pat

type XNPlusKPat GhcRn = NoExtField

type XNPlusKPat GhcTc

Defined in GHC.Hs.Pat

type XNPlusKPat GhcTc = Type

type family XNPat x

Instances

type XNPat GhcPs

Defined in GHC.Hs.Pat

type XNPat GhcPs = EpAnn [AddEpAnn]

type XNPat GhcRn

Defined in GHC.Hs.Pat

type XNPat GhcRn = EpAnn [AddEpAnn]

type XNPat GhcTc

Defined in GHC.Hs.Pat

type XNPat GhcTc = Type

type family XMultiIf x

Instances

type XMultiIf GhcPs

Defined in GHC.Hs.Expr

type XMultiIf GhcPs = EpAnn [AddEpAnn]

type XMultiIf GhcRn

Defined in GHC.Hs.Expr

type XMultiIf GhcRn = NoExtField

type XMultiIf GhcTc

Defined in GHC.Hs.Expr

type XMultiIf GhcTc = Type

type family XMissing x

Instances

type XMissing GhcPs

Defined in GHC.Hs.Expr

type XMissing GhcPs = EpAnn EpaLocation

type XMissing GhcRn

Defined in GHC.Hs.Expr

type XMissing GhcRn = NoExtField

type XMissing GhcTc

Defined in GHC.Hs.Expr

type XMissing GhcTc = Scaled Type

type family XMinimalSig x

Instances

type XMinimalSig (GhcPass p)

Defined in GHC.Hs.Binds

type XMinimalSig (GhcPass p) = EpAnn [AddEpAnn]

type family XMG x b

Instances

type XMG GhcPs b

Defined in GHC.Hs.Expr

type XMG GhcPs b = NoExtField

type XMG GhcRn b

Defined in GHC.Hs.Expr

type XMG GhcRn b = NoExtField

type XMG GhcTc b

Defined in GHC.Hs.Expr

type XMG GhcTc b = MatchGroupTc

type family XLitPat x

Instances

type XLitPat (GhcPass _1)

Defined in GHC.Hs.Pat

type XLitPat (GhcPass _1) = NoExtField

type family XLitE x

Instances

type XLitE (GhcPass _1)

Defined in GHC.Hs.Expr

type XLitE (GhcPass _1) = EpAnnCO

type family XListTy x

Instances

type XListTy (GhcPass _1)

Defined in GHC.Hs.Type

type XListTy (GhcPass _1) = EpAnn AnnParen

type family XListPat x

Instances

type XListPat GhcPs

Defined in GHC.Hs.Pat

type XListPat GhcPs = EpAnn AnnList

type XListPat GhcRn

Defined in GHC.Hs.Pat

type XListPat GhcRn = Maybe (SyntaxExpr GhcRn)

type XListPat GhcTc

Defined in GHC.Hs.Pat

type XListPat GhcTc = ListPatTc

type family XLetStmt x x' b

Instances

type XLetStmt (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XLetStmt (GhcPass _1) (GhcPass _2) b = EpAnn [AddEpAnn]

type family XLet x

Instances

type XLet GhcPs

Defined in GHC.Hs.Expr

type XLet GhcPs = EpAnn AnnsLet

type XLet GhcRn

Defined in GHC.Hs.Expr

type XLet GhcRn = NoExtField

type XLet GhcTc

Defined in GHC.Hs.Expr

type XLet GhcTc = NoExtField

type family XLazyPat x

Instances

type XLazyPat GhcPs

Defined in GHC.Hs.Pat

type XLazyPat GhcPs = EpAnn [AddEpAnn]

type XLazyPat GhcRn

Defined in GHC.Hs.Pat

type XLazyPat GhcRn = NoExtField

type XLazyPat GhcTc

Defined in GHC.Hs.Pat

type XLazyPat GhcTc = NoExtField

type family XLastStmt x x' b

Instances

type XLastStmt (GhcPass _1) (GhcPass _2) b

Defined in GHC.Hs.Expr

type XLastStmt (GhcPass _1) (GhcPass _2) b = NoExtField

type family XLamCase x

Instances

type XLamCase (GhcPass _1)

Defined in GHC.Hs.Expr

type XLamCase (GhcPass _1) = EpAnn [AddEpAnn]

type family XLam x

Instances

type XLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XLam (GhcPass _1) = NoExtField

type XLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XLam (GhcPass _1) = NoExtField

type family XKindedTyVar x

Instances

type XKindedTyVar (GhcPass _1)

Defined in GHC.Hs.Type

type XKindedTyVar (GhcPass _1) = EpAnn [AddEpAnn]

type family XKindSigD x

Instances

type XKindSigD (GhcPass _1)

Defined in GHC.Hs.Decls

type XKindSigD (GhcPass _1) = NoExtField

type family XKindSig x

Instances

type XKindSig (GhcPass _1)

Defined in GHC.Hs.Type

type XKindSig (GhcPass _1) = EpAnn [AddEpAnn]

type family XInstD x

Instances

type XInstD (GhcPass _1)

Defined in GHC.Hs.Decls

type XInstD (GhcPass _1) = NoExtField

type family XInlineSig x

Instances

type XInlineSig (GhcPass p)

Defined in GHC.Hs.Binds

type XInlineSig (GhcPass p) = EpAnn [AddEpAnn]

type family XIf x

Instances

type XIf GhcPs

Defined in GHC.Hs.Expr

type XIf GhcPs = EpAnn AnnsIf

type XIf GhcRn

Defined in GHC.Hs.Expr

type XIf GhcRn = NoExtField

type XIf GhcTc

Defined in GHC.Hs.Expr

type XIf GhcTc = NoExtField

type family XIdSig x

Instances

type XIdSig (GhcPass p)

Defined in GHC.Hs.Binds

type XIdSig (GhcPass p) = NoExtField

type family XIParamTy x

Instances

type XIParamTy (GhcPass _1)

Defined in GHC.Hs.Type

type XIParamTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XIPVar x

Instances

type XIPVar (GhcPass _1)

Defined in GHC.Hs.Expr

type XIPVar (GhcPass _1) = EpAnnCO

type family XIPBinds x

Instances

type XIPBinds GhcPs

Defined in GHC.Hs.Binds

type XIPBinds GhcPs = NoExtField

type XIPBinds GhcRn

Defined in GHC.Hs.Binds

type XIPBinds GhcRn = NoExtField

type XIPBinds GhcTc

Defined in GHC.Hs.Binds

type XIPBinds GhcTc = TcEvBinds

type family XIEVar x

Instances

type XIEVar GhcPs

Defined in GHC.Hs.ImpExp

type XIEVar GhcPs = NoExtField

type XIEVar GhcRn

Defined in GHC.Hs.ImpExp

type XIEVar GhcRn = NoExtField

type XIEVar GhcTc

Defined in GHC.Hs.ImpExp

type XIEVar GhcTc = NoExtField

type family XIEThingWith x

Instances

type XIEThingWith (GhcPass 'Parsed)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Parsed) = EpAnn [AddEpAnn]

type XIEThingWith (GhcPass 'Renamed)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Renamed) = [Located FieldLabel]

type XIEThingWith (GhcPass 'Typechecked)

Defined in GHC.Hs.ImpExp

type XIEThingWith (GhcPass 'Typechecked) = NoExtField

type family XIEThingAll x

Instances

type XIEThingAll (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEThingAll (GhcPass _1) = EpAnn [AddEpAnn]

type family XIEThingAbs x

Instances

type XIEThingAbs (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEThingAbs (GhcPass _1) = EpAnn [AddEpAnn]

type family XIEModuleContents x

Instances

type XIEModuleContents GhcPs

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcPs = EpAnn [AddEpAnn]

type XIEModuleContents GhcRn

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcRn = NoExtField

type XIEModuleContents GhcTc

Defined in GHC.Hs.ImpExp

type XIEModuleContents GhcTc = NoExtField

type family XIEGroup x

Instances

type XIEGroup (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEGroup (GhcPass _1) = NoExtField

type family XIEDocNamed x

Instances

type XIEDocNamed (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEDocNamed (GhcPass _1) = NoExtField

type family XIEDoc x

Instances

type XIEDoc (GhcPass _1)

Defined in GHC.Hs.ImpExp

type XIEDoc (GhcPass _1) = NoExtField

type family XHsWordPrim x

Instances

type XHsWordPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsWordPrim (GhcPass _1) = SourceText

type family XHsWord64Prim x

Instances

type XHsWord64Prim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsWord64Prim (GhcPass _1) = SourceText

type family XHsWC x b

Instances

type XHsWC GhcPs b

Defined in GHC.Hs.Type

type XHsWC GhcPs b = NoExtField

type XHsWC GhcRn b

Defined in GHC.Hs.Type

type XHsWC GhcRn b = [Name]

type XHsWC GhcTc b

Defined in GHC.Hs.Type

type XHsWC GhcTc b = [Name]

type family XHsValBinds x x'

Instances

type XHsValBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XHsValBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList

type family XHsStringPrim x

Instances

type XHsStringPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsStringPrim (GhcPass _1) = SourceText

type family XHsString x

Instances

type XHsString (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsString (GhcPass _1) = SourceText

type family XHsSig x

Instances

type XHsSig (GhcPass _1)

Defined in GHC.Hs.Type

type XHsSig (GhcPass _1) = NoExtField

type family XHsRule x

Instances

type XHsRule GhcPs

Defined in GHC.Hs.Decls

type XHsRule GhcPs = EpAnn HsRuleAnn

type XHsRule GhcRn

Defined in GHC.Hs.Decls

type XHsRule GhcRn = HsRuleRn

type XHsRule GhcTc

Defined in GHC.Hs.Decls

type XHsRule GhcTc = HsRuleRn

type family XHsRecField x

Instances

type XHsRecField _1

Defined in GHC.Hs.Pat

type XHsRecField _1 = EpAnn [AddEpAnn]

type family XHsRat x

Instances

type XHsRat (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsRat (GhcPass _1) = NoExtField

type family XHsQTvs x

Instances

type XHsQTvs GhcPs

Defined in GHC.Hs.Type

type XHsQTvs GhcPs = NoExtField

type XHsQTvs GhcRn

Defined in GHC.Hs.Type

type XHsQTvs GhcRn = HsQTvsRn

type XHsQTvs GhcTc

Defined in GHC.Hs.Type

type XHsQTvs GhcTc = HsQTvsRn

type family XHsPS x

Instances

type XHsPS GhcPs

Defined in GHC.Hs.Type

type XHsPS GhcPs = EpAnn EpaLocation

type XHsPS GhcRn

Defined in GHC.Hs.Type

type XHsPS GhcRn = HsPSRn

type XHsPS GhcTc

Defined in GHC.Hs.Type

type XHsPS GhcTc = HsPSRn

type family XHsOuterImplicit x

Instances

type XHsOuterImplicit GhcPs

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcPs = NoExtField

type XHsOuterImplicit GhcRn

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcRn = [Name]

type XHsOuterImplicit GhcTc

Defined in GHC.Hs.Type

type XHsOuterImplicit GhcTc = [TyVar]

type family XHsOuterExplicit x flag

Instances

type XHsOuterExplicit GhcPs _1

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcPs _1 = EpAnnForallTy

type XHsOuterExplicit GhcRn _1

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcRn _1 = NoExtField

type XHsOuterExplicit GhcTc flag

Defined in GHC.Hs.Type

type XHsOuterExplicit GhcTc flag = [VarBndr TyVar flag]

type family XHsInteger x

Instances

type XHsInteger (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInteger (GhcPass _1) = SourceText

type family XHsIntPrim x

Instances

type XHsIntPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsIntPrim (GhcPass _1) = SourceText

type family XHsInt64Prim x

Instances

type XHsInt64Prim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInt64Prim (GhcPass _1) = SourceText

type family XHsInt x

Instances

type XHsInt (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsInt (GhcPass _1) = NoExtField

type family XHsIPBinds x x'

Instances

type XHsIPBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XHsIPBinds (GhcPass pL) (GhcPass pR) = EpAnn AnnList

type family XHsForAllVis x

Instances

type XHsForAllVis (GhcPass _1)

Defined in GHC.Hs.Type

type XHsForAllVis (GhcPass _1) = EpAnnForallTy

type family XHsForAllInvis x

Instances

type XHsForAllInvis (GhcPass _1)

Defined in GHC.Hs.Type

type XHsForAllInvis (GhcPass _1) = EpAnnForallTy

type family XHsFloatPrim x

Instances

type XHsFloatPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsFloatPrim (GhcPass _1) = NoExtField

type family XHsDoublePrim x

Instances

type XHsDoublePrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsDoublePrim (GhcPass _1) = NoExtField

type family XHsCharPrim x

Instances

type XHsCharPrim (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsCharPrim (GhcPass _1) = SourceText

type family XHsChar x

Instances

type XHsChar (GhcPass _1)

Defined in GHC.Hs.Lit

type XHsChar (GhcPass _1) = SourceText

type family XHsAnnotation x

Instances

type XHsAnnotation (GhcPass _1)

Defined in GHC.Hs.Decls

type XHsAnnotation (GhcPass _1) = EpAnn AnnPragma

type family XGetField x

Instances

type XGetField GhcPs

Defined in GHC.Hs.Expr

type XGetField GhcPs = EpAnnCO

type XGetField GhcRn

Defined in GHC.Hs.Expr

type XGetField GhcRn = NoExtField

type XGetField GhcTc

Defined in GHC.Hs.Expr

type XGetField GhcTc = Void

type family XFunTy x

Instances

type XFunTy (GhcPass _1)

Defined in GHC.Hs.Type

type XFunTy (GhcPass _1) = EpAnn TrailingAnn

type family XFunBind x x'

Instances

type XFunBind (GhcPass pL) GhcPs

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcPs = NoExtField

type XFunBind (GhcPass pL) GhcRn

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcRn = NameSet

type XFunBind (GhcPass pL) GhcTc

Defined in GHC.Hs.Binds

type XFunBind (GhcPass pL) GhcTc = HsWrapper

type family XForeignImport x

Instances

type XForeignImport GhcPs

Defined in GHC.Hs.Decls

type XForeignImport GhcPs = EpAnn [AddEpAnn]

type XForeignImport GhcRn

Defined in GHC.Hs.Decls

type XForeignImport GhcRn = NoExtField

type XForeignImport GhcTc

Defined in GHC.Hs.Decls

type XForeignImport GhcTc = Coercion

type family XForeignExport x

Instances

type XForeignExport GhcPs

Defined in GHC.Hs.Decls

type XForeignExport GhcPs = EpAnn [AddEpAnn]

type XForeignExport GhcRn

Defined in GHC.Hs.Decls

type XForeignExport GhcRn = NoExtField

type XForeignExport GhcTc

Defined in GHC.Hs.Decls

type XForeignExport GhcTc = Coercion

type family XForD x

Instances

type XForD (GhcPass _1)

Defined in GHC.Hs.Decls

type XForD (GhcPass _1) = NoExtField

type family XForAllTy x

Instances

type XForAllTy (GhcPass _1)

Defined in GHC.Hs.Type

type XForAllTy (GhcPass _1) = NoExtField

type family XFixitySig x

Instances

type XFixitySig (GhcPass p)

Defined in GHC.Hs.Binds

type XFixitySig (GhcPass p) = NoExtField

type family XFixSig x

Instances

type XFixSig (GhcPass p)

Defined in GHC.Hs.Binds

type XFixSig (GhcPass p) = EpAnn [AddEpAnn]

type family XFamDecl x

Instances

type XFamDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XFamDecl (GhcPass _1) = NoExtField

type family XExprWithTySig x

Instances

type XExprWithTySig GhcPs

Defined in GHC.Hs.Expr

type XExprWithTySig GhcPs = EpAnn [AddEpAnn]

type XExprWithTySig GhcRn

Defined in GHC.Hs.Expr

type XExprWithTySig GhcRn = NoExtField

type XExprWithTySig GhcTc

Defined in GHC.Hs.Expr

type XExprWithTySig GhcTc = NoExtField

type family XExplicitTupleTy x

Instances

type XExplicitTupleTy GhcPs

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcPs = EpAnn [AddEpAnn]

type XExplicitTupleTy GhcRn

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcRn = NoExtField

type XExplicitTupleTy GhcTc

Defined in GHC.Hs.Type

type XExplicitTupleTy GhcTc = [Kind]

type family XExplicitTuple x

Instances

type XExplicitTuple GhcPs

Defined in GHC.Hs.Expr

type XExplicitTuple GhcPs = EpAnn [AddEpAnn]

type XExplicitTuple GhcRn

Defined in GHC.Hs.Expr

type XExplicitTuple GhcRn = NoExtField

type XExplicitTuple GhcTc

Defined in GHC.Hs.Expr

type XExplicitTuple GhcTc = NoExtField

type family XExplicitSum x

Instances

type XExplicitSum GhcPs

Defined in GHC.Hs.Expr

type XExplicitSum GhcPs = EpAnn AnnExplicitSum

type XExplicitSum GhcRn

Defined in GHC.Hs.Expr

type XExplicitSum GhcRn = NoExtField

type XExplicitSum GhcTc

Defined in GHC.Hs.Expr

type XExplicitSum GhcTc = [Type]

type family XExplicitListTy x

Instances

type XExplicitListTy GhcPs

Defined in GHC.Hs.Type

type XExplicitListTy GhcPs = EpAnn [AddEpAnn]

type XExplicitListTy GhcRn

Defined in GHC.Hs.Type

type XExplicitListTy GhcRn = NoExtField

type XExplicitListTy GhcTc

Defined in GHC.Hs.Type

type XExplicitListTy GhcTc = Kind

type family XExplicitList x

Instances

type XExplicitList GhcPs

Defined in GHC.Hs.Expr

type XExplicitList GhcPs = EpAnn AnnList

type XExplicitList GhcRn

Defined in GHC.Hs.Expr

type XExplicitList GhcRn = NoExtField

type XExplicitList GhcTc

Defined in GHC.Hs.Expr

type XExplicitList GhcTc = Type

type family XExpBr x

Instances

type XExpBr (GhcPass _1)

Defined in GHC.Hs.Expr

type XExpBr (GhcPass _1) = NoExtField

type family XEmptyLocalBinds x x'

Instances

type XEmptyLocalBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XEmptyLocalBinds (GhcPass pL) (GhcPass pR) = NoExtField

type family XDocTy x

Instances

type XDocTy (GhcPass _1)

Defined in GHC.Hs.Type

type XDocTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XDocD x

Instances

type XDocD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDocD (GhcPass _1) = NoExtField

type family XDo x

Instances

type XDo GhcPs

Defined in GHC.Hs.Expr

type XDo GhcPs = EpAnn AnnList

type XDo GhcRn

Defined in GHC.Hs.Expr

type XDo GhcRn = NoExtField

type XDo GhcTc

Defined in GHC.Hs.Expr

type XDo GhcTc = Type

type family XDerivD x

Instances

type XDerivD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDerivD (GhcPass _1) = NoExtField

type family XDefD x

Instances

type XDefD (GhcPass _1)

Defined in GHC.Hs.Decls

type XDefD (GhcPass _1) = NoExtField

type family XDecBrL x

Instances

type XDecBrL (GhcPass _1)

Defined in GHC.Hs.Expr

type XDecBrL (GhcPass _1) = NoExtField

type family XDecBrG x

Instances

type XDecBrG (GhcPass _1)

Defined in GHC.Hs.Expr

type XDecBrG (GhcPass _1) = NoExtField

type family XDctSingle x

Instances

type XDctSingle (GhcPass _1)

Defined in GHC.Hs.Decls

type XDctSingle (GhcPass _1) = NoExtField

type family XDctMulti x

Instances

type XDctMulti (GhcPass _1)

Defined in GHC.Hs.Decls

type XDctMulti (GhcPass _1) = NoExtField

type family XDataFamInstD x

Instances

type XDataFamInstD GhcPs

Defined in GHC.Hs.Decls

type XDataFamInstD GhcPs = EpAnn [AddEpAnn]

type XDataFamInstD GhcRn

Defined in GHC.Hs.Decls

type XDataFamInstD GhcRn = NoExtField

type XDataFamInstD GhcTc

Defined in GHC.Hs.Decls

type XDataFamInstD GhcTc = NoExtField

type family XDataDecl x

Instances

type XDataDecl GhcPs

Defined in GHC.Hs.Decls

type XDataDecl GhcPs = EpAnn [AddEpAnn]

type XDataDecl GhcRn

Defined in GHC.Hs.Decls

type XDataDecl GhcRn = DataDeclRn

type XDataDecl GhcTc

Defined in GHC.Hs.Decls

type XDataDecl GhcTc = DataDeclRn

type family XConPat x

Instances

type XConPat GhcPs

Defined in GHC.Hs.Pat

type XConPat GhcPs = EpAnn [AddEpAnn]

type XConPat GhcRn

Defined in GHC.Hs.Pat

type XConPat GhcRn = NoExtField

type XConPat GhcTc

Defined in GHC.Hs.Pat

type XConPat GhcTc = ConPatTc

type family XConLikeOut x

Instances

type XConLikeOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XConLikeOut (GhcPass _1) = NoExtField

type XConLikeOut (GhcPass _1)

Defined in GHC.Hs.Expr

type XConLikeOut (GhcPass _1) = NoExtField

type family XConDeclH98 x

Instances

type XConDeclH98 (GhcPass _1)

Defined in GHC.Hs.Decls

type XConDeclH98 (GhcPass _1) = EpAnn [AddEpAnn]

type family XConDeclGADT x

Instances

type XConDeclGADT (GhcPass _1)

Defined in GHC.Hs.Decls

type XConDeclGADT (GhcPass _1) = EpAnn [AddEpAnn]

type family XConDeclField x

Instances

type XConDeclField (GhcPass _1)

Defined in GHC.Hs.Type

type XConDeclField (GhcPass _1) = EpAnn [AddEpAnn]

type family XCompleteMatchSig x

Instances

type XCompleteMatchSig (GhcPass p)

Defined in GHC.Hs.Binds

type XCompleteMatchSig (GhcPass p) = EpAnn [AddEpAnn]

type family XCoPat x

type family XCmdWrap x

Instances

type XCmdWrap (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdWrap (GhcPass _1) = NoExtField

type family XCmdTop x

Instances

type XCmdTop GhcPs

Defined in GHC.Hs.Expr

type XCmdTop GhcPs = NoExtField

type XCmdTop GhcRn

Defined in GHC.Hs.Expr

type XCmdTop GhcRn = CmdSyntaxTable GhcRn

type XCmdTop GhcTc

Defined in GHC.Hs.Expr

type XCmdTop GhcTc = CmdTopTc

type family XCmdPar x

Instances

type XCmdPar (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdPar (GhcPass _1) = EpAnn AnnParen

type family XCmdLet x

Instances

type XCmdLet GhcPs

Defined in GHC.Hs.Expr

type XCmdLet GhcPs = EpAnn AnnsLet

type XCmdLet GhcRn

Defined in GHC.Hs.Expr

type XCmdLet GhcRn = NoExtField

type XCmdLet GhcTc

Defined in GHC.Hs.Expr

type XCmdLet GhcTc = NoExtField

type family XCmdLamCase x

Instances

type XCmdLamCase (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdLamCase (GhcPass _1) = EpAnn [AddEpAnn]

type family XCmdLam x

Instances

type XCmdLam (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdLam (GhcPass _1) = NoExtField

type family XCmdIf x

Instances

type XCmdIf GhcPs

Defined in GHC.Hs.Expr

type XCmdIf GhcPs = EpAnn AnnsIf

type XCmdIf GhcRn

Defined in GHC.Hs.Expr

type XCmdIf GhcRn = NoExtField

type XCmdIf GhcTc

Defined in GHC.Hs.Expr

type XCmdIf GhcTc = NoExtField

type family XCmdDo x

Instances

type XCmdDo GhcPs

Defined in GHC.Hs.Expr

type XCmdDo GhcPs = EpAnn AnnList

type XCmdDo GhcRn

Defined in GHC.Hs.Expr

type XCmdDo GhcRn = NoExtField

type XCmdDo GhcTc

Defined in GHC.Hs.Expr

type XCmdDo GhcTc = Type

type family XCmdCase x

Instances

type XCmdCase GhcPs

Defined in GHC.Hs.Expr

type XCmdCase GhcPs = EpAnn EpAnnHsCase

type XCmdCase GhcRn

Defined in GHC.Hs.Expr

type XCmdCase GhcRn = NoExtField

type XCmdCase GhcTc

Defined in GHC.Hs.Expr

type XCmdCase GhcTc = NoExtField

type family XCmdArrForm x

Instances

type XCmdArrForm GhcPs

Defined in GHC.Hs.Expr

type XCmdArrForm GhcPs = EpAnn AnnList

type XCmdArrForm GhcRn

Defined in GHC.Hs.Expr

type XCmdArrForm GhcRn = NoExtField

type XCmdArrForm GhcTc

Defined in GHC.Hs.Expr

type XCmdArrForm GhcTc = NoExtField

type family XCmdArrApp x

Instances

type XCmdArrApp GhcPs

Defined in GHC.Hs.Expr

type XCmdArrApp GhcPs = EpAnn AddEpAnn

type XCmdArrApp GhcRn

Defined in GHC.Hs.Expr

type XCmdArrApp GhcRn = NoExtField

type XCmdArrApp GhcTc

Defined in GHC.Hs.Expr

type XCmdArrApp GhcTc = Type

type family XCmdApp x

Instances

type XCmdApp (GhcPass _1)

Defined in GHC.Hs.Expr

type XCmdApp (GhcPass _1) = EpAnnCO

type family XClsInstD x

Instances

type XClsInstD (GhcPass _1)

Defined in GHC.Hs.Decls

type XClsInstD (GhcPass _1) = NoExtField

type family XClassOpSig x

Instances

type XClassOpSig (GhcPass p)

Defined in GHC.Hs.Binds

type XClassOpSig (GhcPass p) = EpAnn AnnSig

type family XClassDecl x

Instances

type XClassDecl GhcPs

Defined in GHC.Hs.Decls

type XClassDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey, LayoutInfo)

type XClassDecl GhcRn

Defined in GHC.Hs.Decls

type XClassDecl GhcRn = NameSet

type XClassDecl GhcTc

Defined in GHC.Hs.Decls

type XClassDecl GhcTc = NameSet

type family XCase x

Instances

type XCase GhcPs

Defined in GHC.Hs.Expr

type XCase GhcPs = EpAnn EpAnnHsCase

type XCase GhcRn

Defined in GHC.Hs.Expr

type XCase GhcRn = NoExtField

type XCase GhcTc

Defined in GHC.Hs.Expr

type XCase GhcTc = NoExtField

type family XCTyFamInstDecl x

Instances

type XCTyFamInstDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCTyFamInstDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XCTyClGroup x

Instances

type XCTyClGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XCTyClGroup (GhcPass _1) = NoExtField

type family XCRuleDecls x

Instances

type XCRuleDecls GhcPs

Defined in GHC.Hs.Decls

type XCRuleDecls GhcPs = EpAnn [AddEpAnn]

type XCRuleDecls GhcRn

Defined in GHC.Hs.Decls

type XCRuleDecls GhcRn = NoExtField

type XCRuleDecls GhcTc

Defined in GHC.Hs.Decls

type XCRuleDecls GhcTc = NoExtField

type family XCRuleBndr x

Instances

type XCRuleBndr (GhcPass _1)

Defined in GHC.Hs.Decls

type XCRuleBndr (GhcPass _1) = EpAnn [AddEpAnn]

type family XCRoleAnnotDecl x

Instances

type XCRoleAnnotDecl GhcPs

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcPs = EpAnn [AddEpAnn]

type XCRoleAnnotDecl GhcRn

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcRn = NoExtField

type XCRoleAnnotDecl GhcTc

Defined in GHC.Hs.Decls

type XCRoleAnnotDecl GhcTc = NoExtField

type family XCMatch x b

Instances

type XCMatch (GhcPass _1) b

Defined in GHC.Hs.Expr

type XCMatch (GhcPass _1) b = EpAnn [AddEpAnn]

type family XCKindSig x

Instances

type XCKindSig (GhcPass _1)

Defined in GHC.Hs.Decls

type XCKindSig (GhcPass _1) = NoExtField

type family XCInjectivityAnn x

Instances

type XCInjectivityAnn (GhcPass _1)

Defined in GHC.Hs.Decls

type XCInjectivityAnn (GhcPass _1) = EpAnn [AddEpAnn]

type family XCImportDecl x

Instances

type XCImportDecl GhcPs

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcPs = EpAnn EpAnnImportDecl

type XCImportDecl GhcRn

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcRn = NoExtField

type XCImportDecl GhcTc

Defined in GHC.Hs.ImpExp

type XCImportDecl GhcTc = NoExtField

type family XCIPBind x

Instances

type XCIPBind (GhcPass p)

Defined in GHC.Hs.Binds

type XCIPBind (GhcPass p) = EpAnn [AddEpAnn]

type family XCHsGroup x

Instances

type XCHsGroup (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsGroup (GhcPass _1) = NoExtField

type family XCHsFieldLabel x

Instances

type XCHsFieldLabel (GhcPass _1)

Defined in GHC.Hs.Expr

type XCHsFieldLabel (GhcPass _1) = EpAnn AnnFieldLabel

type family XCHsDerivingClause x

Instances

type XCHsDerivingClause (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsDerivingClause (GhcPass _1) = EpAnn [AddEpAnn]

type family XCHsDataDefn x

Instances

type XCHsDataDefn (GhcPass _1)

Defined in GHC.Hs.Decls

type XCHsDataDefn (GhcPass _1) = NoExtField

type family XCGRHSs x b

Instances

type XCGRHSs (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XCGRHSs (GhcPass _1) _2 = EpAnnComments

type family XCGRHS x b

Instances

type XCGRHS (GhcPass _1) _2

Defined in GHC.Hs.Expr

type XCGRHS (GhcPass _1) _2 = EpAnn GrhsAnn

type family XCFunDep x

Instances

type XCFunDep (GhcPass _1)

Defined in GHC.Hs.Decls

type XCFunDep (GhcPass _1) = EpAnn [AddEpAnn]

type family XCFieldOcc x

Instances

type XCFieldOcc GhcPs

Defined in GHC.Hs.Type

type XCFieldOcc GhcPs = NoExtField

type XCFieldOcc GhcRn

Defined in GHC.Hs.Type

type XCFieldOcc GhcRn = Name

type XCFieldOcc GhcTc

Defined in GHC.Hs.Type

type XCFieldOcc GhcTc = Id

type family XCFamilyDecl x

Instances

type XCFamilyDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCFamilyDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XCFamEqn x r

Instances

type XCFamEqn (GhcPass _1) r

Defined in GHC.Hs.Decls

type XCFamEqn (GhcPass _1) r = EpAnn [AddEpAnn]

type family XCDerivDecl x

Instances

type XCDerivDecl (GhcPass _1)

Defined in GHC.Hs.Decls

type XCDerivDecl (GhcPass _1) = EpAnn [AddEpAnn]

type family XCDefaultDecl x

Instances

type XCDefaultDecl GhcPs

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcPs = EpAnn [AddEpAnn]

type XCDefaultDecl GhcRn

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcRn = NoExtField

type XCDefaultDecl GhcTc

Defined in GHC.Hs.Decls

type XCDefaultDecl GhcTc = NoExtField

type family XCClsInstDecl x

Instances

type XCClsInstDecl GhcPs

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcPs = (EpAnn [AddEpAnn], AnnSortKey)

type XCClsInstDecl GhcRn

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcRn = NoExtField

type XCClsInstDecl GhcTc

Defined in GHC.Hs.Decls

type XCClsInstDecl GhcTc = NoExtField

type family XBracket x

Instances

type XBracket (GhcPass _1)

Defined in GHC.Hs.Expr

type XBracket (GhcPass _1) = EpAnn [AddEpAnn]

type family XBodyStmt x x' b

Instances

type XBodyStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcPs b = NoExtField

type XBodyStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcRn b = NoExtField

type XBodyStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XBodyStmt (GhcPass _1) GhcTc b = Type

type family XBindStmt x x' b

Instances

type XBindStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcPs b = EpAnn [AddEpAnn]

type XBindStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcRn b = XBindStmtRn

type XBindStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XBindStmt (GhcPass _1) GhcTc b = XBindStmtTc

type family XBinTick x

Instances

type XBinTick (GhcPass _1)

Defined in GHC.Hs.Expr

type XBinTick (GhcPass _1) = NoExtField

type family XBangTy x

Instances

type XBangTy (GhcPass _1)

Defined in GHC.Hs.Type

type XBangTy (GhcPass _1) = EpAnn [AddEpAnn]

type family XBangPat x

Instances

type XBangPat GhcPs

Defined in GHC.Hs.Pat

type XBangPat GhcPs = EpAnn [AddEpAnn]

type XBangPat GhcRn

Defined in GHC.Hs.Pat

type XBangPat GhcRn = NoExtField

type XBangPat GhcTc

Defined in GHC.Hs.Pat

type XBangPat GhcTc = NoExtField

type family XAsPat x

Instances

type XAsPat GhcPs

Defined in GHC.Hs.Pat

type XAsPat GhcPs = EpAnn [AddEpAnn]

type XAsPat GhcRn

Defined in GHC.Hs.Pat

type XAsPat GhcRn = NoExtField

type XAsPat GhcTc

Defined in GHC.Hs.Pat

type XAsPat GhcTc = NoExtField

type family XArithSeq x

Instances

type XArithSeq GhcPs

Defined in GHC.Hs.Expr

type XArithSeq GhcPs = EpAnn [AddEpAnn]

type XArithSeq GhcRn

Defined in GHC.Hs.Expr

type XArithSeq GhcRn = NoExtField

type XArithSeq GhcTc

Defined in GHC.Hs.Expr

type XArithSeq GhcTc = PostTcExpr

type family XApplicativeStmt x x' b

Instances

type XApplicativeStmt (GhcPass _1) GhcPs b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcPs b = NoExtField

type XApplicativeStmt (GhcPass _1) GhcRn b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcRn b = NoExtField

type XApplicativeStmt (GhcPass _1) GhcTc b

Defined in GHC.Hs.Expr

type XApplicativeStmt (GhcPass _1) GhcTc b = Type

type family XApplicativeArgOne x

Instances

type XApplicativeArgOne GhcPs

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcPs = NoExtField

type XApplicativeArgOne GhcRn

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcRn = FailOperator GhcRn

type XApplicativeArgOne GhcTc

Defined in GHC.Hs.Expr

type XApplicativeArgOne GhcTc = FailOperator GhcTc

type family XApplicativeArgMany x

Instances

type XApplicativeArgMany (GhcPass _1)

Defined in GHC.Hs.Expr

type XApplicativeArgMany (GhcPass _1) = NoExtField

type family XAppTypeE x

Instances

type XAppTypeE GhcPs

Defined in GHC.Hs.Expr

type XAppTypeE GhcPs = SrcSpan

type XAppTypeE GhcRn

Defined in GHC.Hs.Expr

type XAppTypeE GhcRn = NoExtField

type XAppTypeE GhcTc

Defined in GHC.Hs.Expr

type XAppTypeE GhcTc = Type

type family XAppTy x

Instances

type XAppTy (GhcPass _1)

Defined in GHC.Hs.Type

type XAppTy (GhcPass _1) = NoExtField

type family XAppKindTy x

Instances

type XAppKindTy (GhcPass _1)

Defined in GHC.Hs.Type

type XAppKindTy (GhcPass _1) = SrcSpan

type family XApp x

Instances

type XApp (GhcPass _1)

Defined in GHC.Hs.Expr

type XApp (GhcPass _1) = EpAnnCO

type family XAnyClassStrategy x

Instances

type XAnyClassStrategy GhcPs

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcPs = EpAnn [AddEpAnn]

type XAnyClassStrategy GhcRn

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcRn = NoExtField

type XAnyClassStrategy GhcTc

Defined in GHC.Hs.Decls

type XAnyClassStrategy GhcTc = NoExtField

type family XAnnD x

Instances

type XAnnD (GhcPass _1)

Defined in GHC.Hs.Decls

type XAnnD (GhcPass _1) = NoExtField

type family XAmbiguous x

Instances

type XAmbiguous GhcPs

Defined in GHC.Hs.Type

type XAmbiguous GhcPs = NoExtField

type XAmbiguous GhcRn

Defined in GHC.Hs.Type

type XAmbiguous GhcRn = NoExtField

type XAmbiguous GhcTc

Defined in GHC.Hs.Type

type XAmbiguous GhcTc = Id

type family XAbsBinds x x'

Instances

type XAbsBinds (GhcPass pL) (GhcPass pR)

Defined in GHC.Hs.Binds

type XAbsBinds (GhcPass pL) (GhcPass pR) = NoExtField

type family XABE x

Instances

type XABE (GhcPass p)

Defined in GHC.Hs.Binds

type XABE (GhcPass p) = NoExtField

class WrapXRec p a where

The trivial wrapper that carries no additional information See Note [XRec and SrcSpans in the AST]

Methods

wrapXRec :: a -> XRec p a

class UnXRec p where

We can strip off the XRec to access the underlying data. See Note [XRec and SrcSpans in the AST]

Methods

unXRec :: XRec p a -> a

Instances

UnXRec (GhcPass p)

Defined in GHC.Hs.Extension

Methods

unXRec :: XRec (GhcPass p) a -> a

type family NoGhcTc p

See Note [NoGhcTc] in GHC.Hs.Extension. It has to be in this module because it is used like an extension point (in the data definitions of types that should be parameter-agnostic.

Instances

type NoGhcTc (GhcPass pass)

Marks that a field uses the GhcRn variant even when the pass parameter is GhcTc. Useful for storing HsTypes in GHC.Hs.Exprs, say, because HsType GhcTc should never occur. See Note [NoGhcTc]

Defined in GHC.Hs.Extension

type NoGhcTc (GhcPass pass) = GhcPass (NoGhcTcPass pass)

data NoExtField

A placeholder type for TTG extension points that are not currently unused to represent any particular value.

This should not be confused with NoExtCon, which are found in unused extension constructors and therefore should never be inhabited. In contrast, NoExtField is used in extension points (e.g., as the field of some constructor), so it must have an inhabitant to construct AST passes that manipulate fields with that extension point as their type.

Constructors

NoExtField

Instances

Data NoExtField

Defined in Language.Haskell.Syntax.Extension

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NoExtField -> c NoExtField

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NoExtField

toConstr :: NoExtField -> Constr

dataTypeOf :: NoExtField -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NoExtField)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NoExtField)

gmapT :: (forall b. Data b => b -> b) -> NoExtField -> NoExtField

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NoExtField -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NoExtField -> r

gmapQ :: (forall d. Data d => d -> u) -> NoExtField -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NoExtField -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NoExtField -> m NoExtField

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NoExtField -> m NoExtField

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NoExtField -> m NoExtField

Outputable NoExtField

Defined in Language.Haskell.Syntax.Extension

Methods

ppr :: NoExtField -> SDoc

Eq NoExtField

Defined in Language.Haskell.Syntax.Extension

Methods

(==) :: NoExtField -> NoExtField -> Bool

(/=) :: NoExtField -> NoExtField -> Bool

Ord NoExtField

Defined in Language.Haskell.Syntax.Extension

Methods

compare :: NoExtField -> NoExtField -> Ordering

(<) :: NoExtField -> NoExtField -> Bool

(<=) :: NoExtField -> NoExtField -> Bool

(>) :: NoExtField -> NoExtField -> Bool

(>=) :: NoExtField -> NoExtField -> Bool

max :: NoExtField -> NoExtField -> NoExtField

min :: NoExtField -> NoExtField -> NoExtField

ToHie (Context (Located NoExtField))

Defined in Compat.HieAst

Methods

toHie :: Context (Located NoExtField) -> HieM [HieAST Type]

data NoExtCon

Used in TTG extension constructors that have yet to be extended with anything. If an extension constructor has NoExtCon as its field, it is not intended to ever be constructed anywhere, and any function that consumes the extension constructor can eliminate it by way of noExtCon.

This should not be confused with NoExtField, which are found in unused extension points (not constructors) and therefore can be inhabited.

Instances

Data NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> NoExtCon -> c NoExtCon

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c NoExtCon

toConstr :: NoExtCon -> Constr

dataTypeOf :: NoExtCon -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c NoExtCon)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c NoExtCon)

gmapT :: (forall b. Data b => b -> b) -> NoExtCon -> NoExtCon

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> NoExtCon -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> NoExtCon -> r

gmapQ :: (forall d. Data d => d -> u) -> NoExtCon -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> NoExtCon -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> NoExtCon -> m NoExtCon

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> NoExtCon -> m NoExtCon

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> NoExtCon -> m NoExtCon

Outputable NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

ppr :: NoExtCon -> SDoc

Eq NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

(==) :: NoExtCon -> NoExtCon -> Bool

(/=) :: NoExtCon -> NoExtCon -> Bool

Ord NoExtCon

Defined in Language.Haskell.Syntax.Extension

Methods

compare :: NoExtCon -> NoExtCon -> Ordering

(<) :: NoExtCon -> NoExtCon -> Bool

(<=) :: NoExtCon -> NoExtCon -> Bool

(>) :: NoExtCon -> NoExtCon -> Bool

(>=) :: NoExtCon -> NoExtCon -> Bool

max :: NoExtCon -> NoExtCon -> NoExtCon

min :: NoExtCon -> NoExtCon -> NoExtCon

class MapXRec p where

We can map over the underlying type contained in an XRec while preserving the annotation as is.

Methods

mapXRec :: Anno a ~ Anno b => (a -> b) -> XRec p a -> XRec p b

Instances

MapXRec (GhcPass p)

Defined in GHC.Hs.Extension

Methods

mapXRec :: Anno a ~ Anno b => (a -> b) -> XRec (GhcPass p) a -> XRec (GhcPass p) b

type LIdP p = XRec p (IdP p)

type family IdP p

Maps the "normal" id type for a given pass

Instances

type IdP (GhcPass p)

Defined in GHC.Hs.Extension

type IdP (GhcPass p) = IdGhcP p

type family Anno a = (b :: Type)

Instances

type Anno ConLike

Defined in GHC.Hs.Pat

type Anno ConLike = SrcSpanAnnN

type Anno OverlapMode

Defined in GHC.Hs.Decls

type Anno OverlapMode = SrcSpanAnnP

type Anno OverlapMode

Defined in GHC.Hs.Decls

type Anno OverlapMode = SrcSpanAnnP

type Anno CType

Defined in GHC.Hs.Decls

type Anno CType = SrcSpanAnnP

type Anno Name

Defined in GHC.Hs.Extension

type Anno Name = SrcSpanAnnN

type Anno RdrName

Defined in GHC.Hs.Extension

type Anno RdrName = SrcSpanAnnN

type Anno StringLiteral

Defined in GHC.Hs.Binds

type Anno StringLiteral = SrcSpan

type Anno Id

Defined in GHC.Hs.Extension

type Anno Id = SrcSpanAnnN

type Anno ModuleName

Defined in GHC.Hs.ImpExp

type Anno ModuleName = SrcSpanAnnA

type Anno DocDecl

Defined in GHC.Hs.Decls

type Anno DocDecl = SrcSpanAnnA

type Anno HsIPName

Defined in GHC.Hs.Type

type Anno HsIPName = SrcSpan

type Anno Bool

Defined in GHC.Hs.Decls

type Anno Bool = SrcSpan

type Anno (IE (GhcPass p))

Defined in GHC.Hs.ImpExp

type Anno (IE (GhcPass p)) = SrcSpanAnnA

type Anno (ImportDecl (GhcPass p))

Defined in GHC.Hs.ImpExp

type Anno (ImportDecl (GhcPass p)) = SrcSpanAnnA

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno (FixitySig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (FixitySig (GhcPass p)) = SrcSpanAnnA

type Anno (IPBind (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (IPBind (GhcPass p)) = SrcSpanAnnA

type Anno (Sig (GhcPass p))

Defined in GHC.Hs.Binds

type Anno (Sig (GhcPass p)) = SrcSpanAnnA

type Anno (AnnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (AnnDecl (GhcPass p)) = SrcSpanAnnA

type Anno (ClsInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ClsInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (ConDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ConDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DataFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DataFamInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DefaultDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DefaultDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DerivClauseTys (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (DerivClauseTys (GhcPass _1)) = SrcSpanAnnC

type Anno (DerivDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivDecl (GhcPass p)) = SrcSpanAnnA

type Anno (DerivStrategy (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (DerivStrategy (GhcPass p)) = SrcSpan

type Anno (FamilyDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyDecl (GhcPass p)) = SrcSpanAnnA

type Anno (FamilyResultSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FamilyResultSig (GhcPass p)) = SrcSpan

type Anno (ForeignDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (ForeignDecl (GhcPass p)) = SrcSpanAnnA

type Anno (FunDep (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (FunDep (GhcPass p)) = SrcSpanAnnA

type Anno (HsDecl (GhcPass _1))

Defined in GHC.Hs.Decls

type Anno (HsDecl (GhcPass _1)) = SrcSpanAnnA

type Anno (HsDerivingClause (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (HsDerivingClause (GhcPass p)) = SrcSpan

type Anno (InjectivityAnn (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InjectivityAnn (GhcPass p)) = SrcSpan

type Anno (InstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (InstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RoleAnnotDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RoleAnnotDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RuleBndr (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleBndr (GhcPass p)) = SrcSpan

type Anno (RuleDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecl (GhcPass p)) = SrcSpanAnnA

type Anno (RuleDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (RuleDecls (GhcPass p)) = SrcSpanAnnA

type Anno (SpliceDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (SpliceDecl (GhcPass p)) = SrcSpanAnnA

type Anno (StandaloneKindSig (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (StandaloneKindSig (GhcPass p)) = SrcSpanAnnA

type Anno (TyClDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyClDecl (GhcPass p)) = SrcSpanAnnA

type Anno (TyFamInstDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (TyFamInstDecl (GhcPass p)) = SrcSpanAnnA

type Anno (WarnDecl (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecl (GhcPass p)) = SrcSpanAnnA

type Anno (WarnDecls (GhcPass p))

Defined in GHC.Hs.Decls

type Anno (WarnDecls (GhcPass p)) = SrcSpanAnnA

type Anno (HsCmd (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmd (GhcPass p)) = SrcSpanAnnA

type Anno (HsCmdTop (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsCmdTop (GhcPass p)) = SrcSpan

type Anno (HsExpr (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsExpr (GhcPass p)) = SrcSpanAnnA

type Anno (HsSplice (GhcPass p))

Defined in GHC.Hs.Expr

type Anno (HsSplice (GhcPass p)) = SrcSpanAnnA

type Anno (HsOverLit (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (HsOverLit (GhcPass p)) = SrcSpan

type Anno (Pat (GhcPass p))

Defined in GHC.Hs.Pat

type Anno (Pat (GhcPass p)) = SrcSpanAnnA

type Anno (AmbiguousFieldOcc GhcTc)

Defined in GHC.Hs.Pat

type Anno (AmbiguousFieldOcc GhcTc) = SrcSpanAnnA

type Anno (BangType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (BangType (GhcPass p)) = SrcSpanAnnA

type Anno (ConDeclField (GhcPass p))

Defined in GHC.Hs.Type

type Anno (ConDeclField (GhcPass p)) = SrcSpanAnnA

type Anno (FieldOcc (GhcPass p))

Defined in GHC.Hs.Type

type Anno (FieldOcc (GhcPass p)) = SrcSpan

type Anno (HsKind (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsKind (GhcPass p)) = SrcSpanAnnA

type Anno (HsSigType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsSigType (GhcPass p)) = SrcSpanAnnA

type Anno (HsType (GhcPass p))

Defined in GHC.Hs.Type

type Anno (HsType (GhcPass p)) = SrcSpanAnnA

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.PostProcess

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.Types

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (HsBindLR (GhcPass idL) (GhcPass idR))

Defined in GHC.Hs.Binds

type Anno (HsBindLR (GhcPass idL) (GhcPass idR)) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn (GhcPass p) _1)

Defined in GHC.Hs.Decls

type Anno (FamEqn (GhcPass p) _1) = SrcSpanAnnA

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField (GhcPass p) arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField (GhcPass p) arg) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (HsRecField' p arg)

Defined in GHC.Hs.Pat

type Anno (HsRecField' p arg) = SrcSpanAnnA

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2))

Defined in GHC.Hs.Type

type Anno (HsOuterTyVarBndrs _1 (GhcPass _2)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag (GhcPass _1))

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag (GhcPass _1)) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcPs)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcPs) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcRn)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcRn) = SrcSpanAnnA

type Anno (HsTyVarBndr _flag GhcTc)

Defined in GHC.Hs.Type

type Anno (HsTyVarBndr _flag GhcTc) = SrcSpanAnnA

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

type Anno (SourceText, RuleName)

Defined in GHC.Hs.Decls

type Anno (SourceText, RuleName) = SrcSpan

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

noExtField :: NoExtField

Used when constructing a term with an unused extension point.

noExtCon :: NoExtCon -> a

Eliminate a NoExtCon. Much like absurd.

data SrcUnpackedness

Source Unpackedness

What unpackedness the user requested

Constructors

SrcUnpack

{-# UNPACK #-} specified

SrcNoUnpack

{-# NOUNPACK #-} specified

NoSrcUnpack

no unpack pragma

Instances

Data SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcUnpackedness -> c SrcUnpackedness

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcUnpackedness

toConstr :: SrcUnpackedness -> Constr

dataTypeOf :: SrcUnpackedness -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcUnpackedness)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcUnpackedness)

gmapT :: (forall b. Data b => b -> b) -> SrcUnpackedness -> SrcUnpackedness

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcUnpackedness -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcUnpackedness -> r

gmapQ :: (forall d. Data d => d -> u) -> SrcUnpackedness -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcUnpackedness -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcUnpackedness -> m SrcUnpackedness

Binary SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

put_ :: BinHandle -> SrcUnpackedness -> IO ()

put :: BinHandle -> SrcUnpackedness -> IO (Bin SrcUnpackedness)

get :: BinHandle -> IO SrcUnpackedness

Outputable SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcUnpackedness -> SDoc

Eq SrcUnpackedness

Defined in GHC.Core.DataCon

Methods

(==) :: SrcUnpackedness -> SrcUnpackedness -> Bool

(/=) :: SrcUnpackedness -> SrcUnpackedness -> Bool

data SrcStrictness

Source Strictness

What strictness annotation the user wrote

Constructors

SrcLazy

Lazy, ie ~

SrcStrict

Strict, ie !

NoSrcStrict

no strictness annotation

Instances

Data SrcStrictness

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcStrictness -> c SrcStrictness

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SrcStrictness

toConstr :: SrcStrictness -> Constr

dataTypeOf :: SrcStrictness -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SrcStrictness)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SrcStrictness)

gmapT :: (forall b. Data b => b -> b) -> SrcStrictness -> SrcStrictness

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcStrictness -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcStrictness -> r

gmapQ :: (forall d. Data d => d -> u) -> SrcStrictness -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcStrictness -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcStrictness -> m SrcStrictness

Binary SrcStrictness

Defined in GHC.Core.DataCon

Methods

put_ :: BinHandle -> SrcStrictness -> IO ()

put :: BinHandle -> SrcStrictness -> IO (Bin SrcStrictness)

get :: BinHandle -> IO SrcStrictness

Outputable SrcStrictness

Defined in GHC.Core.DataCon

Methods

ppr :: SrcStrictness -> SDoc

Eq SrcStrictness

Defined in GHC.Core.DataCon

Methods

(==) :: SrcStrictness -> SrcStrictness -> Bool

(/=) :: SrcStrictness -> SrcStrictness -> Bool

data HsSrcBang

Haskell Source Bang

Bangs on data constructor arguments as the user wrote them in the source code.

(HsSrcBang _ SrcUnpack SrcLazy) and (HsSrcBang _ SrcUnpack NoSrcStrict) (without StrictData) makes no sense, we emit a warning (in checkValidDataCon) and treat it like (HsSrcBang _ NoSrcUnpack SrcLazy)

Constructors

HsSrcBang SourceText SrcUnpackedness SrcStrictness

Instances

Data HsSrcBang

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsSrcBang -> c HsSrcBang

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsSrcBang

toConstr :: HsSrcBang -> Constr

dataTypeOf :: HsSrcBang -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsSrcBang)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsSrcBang)

gmapT :: (forall b. Data b => b -> b) -> HsSrcBang -> HsSrcBang

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsSrcBang -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsSrcBang -> r

gmapQ :: (forall d. Data d => d -> u) -> HsSrcBang -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsSrcBang -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsSrcBang -> m HsSrcBang

Outputable HsSrcBang

Defined in GHC.Core.DataCon

Methods

ppr :: HsSrcBang -> SDoc

data HsImplBang

Haskell Implementation Bang

Bangs of data constructor arguments as generated by the compiler after consulting HsSrcBang, flags, etc.

Constructors

HsLazy

Lazy field, or one with an unlifted type

HsStrict

Strict but not unpacked field

HsUnpack (Maybe Coercion)

Strict and unpacked field co :: arg-ty ~ product-ty HsBang

Instances

Data HsImplBang

Defined in GHC.Core.DataCon

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsImplBang -> c HsImplBang

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsImplBang

toConstr :: HsImplBang -> Constr

dataTypeOf :: HsImplBang -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsImplBang)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsImplBang)

gmapT :: (forall b. Data b => b -> b) -> HsImplBang -> HsImplBang

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsImplBang -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsImplBang -> r

gmapQ :: (forall d. Data d => d -> u) -> HsImplBang -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsImplBang -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsImplBang -> m HsImplBang

Outputable HsImplBang

Defined in GHC.Core.DataCon

Methods

ppr :: HsImplBang -> SDoc

type Mult = Type

Mult is a type alias for Type.

Mult must contain Type because multiplicity variables are mere type variables (of kind Multiplicity) in Haskell. So the simplest implementation is to make Mult be Type.

Multiplicities can be formed with: - One: GHC.Types.One (= oneDataCon) - Many: GHC.Types.Many (= manyDataCon) - Multiplication: GHC.Types.MultMul (= multMulTyCon)

So that Mult feels a bit more structured, we provide pattern synonyms and smart constructors for these.

data SpliceExplicitFlag

Constructors

ExplicitSplice

= $(f x y)

ImplicitSplice

= f x y, i.e. a naked top level expression

Instances

Data SpliceExplicitFlag

Defined in GHC.Types.Basic

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SpliceExplicitFlag -> c SpliceExplicitFlag

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c SpliceExplicitFlag

toConstr :: SpliceExplicitFlag -> Constr

dataTypeOf :: SpliceExplicitFlag -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c SpliceExplicitFlag)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c SpliceExplicitFlag)

gmapT :: (forall b. Data b => b -> b) -> SpliceExplicitFlag -> SpliceExplicitFlag

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SpliceExplicitFlag -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SpliceExplicitFlag -> r

gmapQ :: (forall d. Data d => d -> u) -> SpliceExplicitFlag -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SpliceExplicitFlag -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SpliceExplicitFlag -> m SpliceExplicitFlag

module GHC.Rename.Names

module GHC.Rename.Splice

module GHC.Tc.Instance.Family

module GHC.Tc.Module

module GHC.Tc.Types

type TcMCoercionR = MCoercionR

type TcMCoercionN = MCoercionN

type TcMCoercion = MCoercion

data TcEvBinds

Constructors

TcEvBinds EvBindsVar

EvBinds (Bag EvBind)

Instances

Data TcEvBinds

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> TcEvBinds -> c TcEvBinds

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c TcEvBinds

toConstr :: TcEvBinds -> Constr

dataTypeOf :: TcEvBinds -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c TcEvBinds)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c TcEvBinds)

gmapT :: (forall b. Data b => b -> b) -> TcEvBinds -> TcEvBinds

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> TcEvBinds -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> TcEvBinds -> r

gmapQ :: (forall d. Data d => d -> u) -> TcEvBinds -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> TcEvBinds -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> TcEvBinds -> m TcEvBinds

Outputable TcEvBinds

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: TcEvBinds -> SDoc

ToHie (EvBindContext (LocatedA TcEvBinds))

Defined in Compat.HieAst

Methods

toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]

type TcCoercionR = CoercionR

type TcCoercionP = CoercionP

type TcCoercionN = CoercionN

type TcCoercion = Coercion

data QuoteWrapper

Constructors

QuoteWrapper EvVar Type

Instances

Data QuoteWrapper

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> QuoteWrapper -> c QuoteWrapper

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c QuoteWrapper

toConstr :: QuoteWrapper -> Constr

dataTypeOf :: QuoteWrapper -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c QuoteWrapper)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c QuoteWrapper)

gmapT :: (forall b. Data b => b -> b) -> QuoteWrapper -> QuoteWrapper

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> QuoteWrapper -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> QuoteWrapper -> r

gmapQ :: (forall d. Data d => d -> u) -> QuoteWrapper -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> QuoteWrapper -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> QuoteWrapper -> m QuoteWrapper

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> QuoteWrapper -> m QuoteWrapper

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> QuoteWrapper -> m QuoteWrapper

data HsWrapper

Constructors

WpHole

WpCompose HsWrapper HsWrapper

WpFun HsWrapper HsWrapper (Scaled TcType) SDoc

WpCast TcCoercionR

WpEvLam EvVar

WpEvApp EvTerm

WpTyLam TyVar

WpTyApp KindOrType

WpLet TcEvBinds

WpMultCoercion Coercion

Instances

Data HsWrapper

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsWrapper -> c HsWrapper

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsWrapper

toConstr :: HsWrapper -> Constr

dataTypeOf :: HsWrapper -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsWrapper)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsWrapper)

gmapT :: (forall b. Data b => b -> b) -> HsWrapper -> HsWrapper

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsWrapper -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsWrapper -> r

gmapQ :: (forall d. Data d => d -> u) -> HsWrapper -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsWrapper -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsWrapper -> m HsWrapper

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsWrapper -> m HsWrapper

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsWrapper -> m HsWrapper

Outputable HsWrapper

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: HsWrapper -> SDoc

ToHie (LocatedA HsWrapper)

Defined in Compat.HieAst

Methods

toHie :: LocatedA HsWrapper -> HieM [HieAST Type]

data HoleExprRef

Where to store evidence for expression holes See Note [Holes] in GHC.Tc.Types.Constraint

Constructors

HER

Fields

• (IORef EvTerm)

  where to write the erroring expression

• TcType

  expected type of that expression

• Unique

  for debug output only

Instances

Data HoleExprRef

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HoleExprRef -> c HoleExprRef

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HoleExprRef

toConstr :: HoleExprRef -> Constr

dataTypeOf :: HoleExprRef -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HoleExprRef)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HoleExprRef)

gmapT :: (forall b. Data b => b -> b) -> HoleExprRef -> HoleExprRef

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HoleExprRef -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HoleExprRef -> r

gmapQ :: (forall d. Data d => d -> u) -> HoleExprRef -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HoleExprRef -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HoleExprRef -> m HoleExprRef

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HoleExprRef -> m HoleExprRef

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HoleExprRef -> m HoleExprRef

Outputable HoleExprRef

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: HoleExprRef -> SDoc

data EvTypeable

Instructions on how to make a Typeable dictionary. See Note [Typeable evidence terms]

Constructors

EvTypeableTyCon TyCon [EvTerm]

Dictionary for Typeable T where T is a type constructor with all of its kind variables saturated. The [EvTerm] is Typeable evidence for the applied kinds..

EvTypeableTyApp EvTerm EvTerm

Dictionary for Typeable (s t), given a dictionaries for s and t.

EvTypeableTrFun EvTerm EvTerm EvTerm

Dictionary for Typeable (s # w -> t), given a dictionaries for w, s, and t.

EvTypeableTyLit EvTerm

Dictionary for a type literal, e.g. Typeable "foo" or Typeable 3 The EvTerm is evidence of, e.g., KnownNat 3 (see #10348)

Instances

Data EvTypeable

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EvTypeable -> c EvTypeable

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EvTypeable

toConstr :: EvTypeable -> Constr

dataTypeOf :: EvTypeable -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EvTypeable)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EvTypeable)

gmapT :: (forall b. Data b => b -> b) -> EvTypeable -> EvTypeable

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EvTypeable -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EvTypeable -> r

gmapQ :: (forall d. Data d => d -> u) -> EvTypeable -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EvTypeable -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EvTypeable -> m EvTypeable

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EvTypeable -> m EvTypeable

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EvTypeable -> m EvTypeable

Outputable EvTypeable

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvTypeable -> SDoc

data EvTerm

Constructors

EvExpr EvExpr

EvTypeable Type EvTypeable

EvFun

Fields

• et_tvs :: [TyVar]
• et_given :: [EvVar]
• et_binds :: TcEvBinds
• et_body :: EvVar

Instances

Data EvTerm

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EvTerm -> c EvTerm

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EvTerm

toConstr :: EvTerm -> Constr

dataTypeOf :: EvTerm -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EvTerm)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EvTerm)

gmapT :: (forall b. Data b => b -> b) -> EvTerm -> EvTerm

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EvTerm -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EvTerm -> r

gmapQ :: (forall d. Data d => d -> u) -> EvTerm -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EvTerm -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EvTerm -> m EvTerm

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EvTerm -> m EvTerm

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EvTerm -> m EvTerm

Outputable EvTerm

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvTerm -> SDoc

type EvExpr = CoreExpr

data EvCallStack

Evidence for CallStack implicit parameters.

Constructors

EvCsEmpty

EvCsPushCall Name RealSrcSpan EvExpr

EvCsPushCall name loc stk represents a call to name, occurring at loc, in a calling context stk.

Instances

Data EvCallStack

Defined in GHC.Tc.Types.Evidence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> EvCallStack -> c EvCallStack

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c EvCallStack

toConstr :: EvCallStack -> Constr

dataTypeOf :: EvCallStack -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c EvCallStack)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c EvCallStack)

gmapT :: (forall b. Data b => b -> b) -> EvCallStack -> EvCallStack

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> EvCallStack -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> EvCallStack -> r

gmapQ :: (forall d. Data d => d -> u) -> EvCallStack -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> EvCallStack -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> EvCallStack -> m EvCallStack

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> EvCallStack -> m EvCallStack

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> EvCallStack -> m EvCallStack

Outputable EvCallStack

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvCallStack -> SDoc

data EvBindsVar

Constructors

EvBindsVar

Fields

• ebv_uniq :: Unique
• ebv_binds :: IORef EvBindMap
• ebv_tcvs :: IORef CoVarSet

CoEvBindsVar

Fields

• ebv_uniq :: Unique
• ebv_tcvs :: IORef CoVarSet

Instances

Uniquable EvBindsVar

Defined in GHC.Tc.Types.Evidence

Methods

getUnique :: EvBindsVar -> Unique

Outputable EvBindsVar

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBindsVar -> SDoc

newtype EvBindMap

Constructors

EvBindMap

Fields

• ev_bind_varenv :: DVarEnv EvBind

Instances

Outputable EvBindMap

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBindMap -> SDoc

data EvBind

Constructors

EvBind

Fields

• eb_lhs :: EvVar
• eb_rhs :: EvTerm
• eb_is_given :: Bool

Instances

Outputable EvBind

Defined in GHC.Tc.Types.Evidence

Methods

ppr :: EvBind -> SDoc

wrapIP :: Type -> CoercionR

Create a Expr that wraps a value in an implicit-parameter dictionary. See unwrapIP.

varSetMinusEvBindMap :: VarSet -> EvBindMap -> VarSet

unwrapIP :: Type -> CoercionR

Create a Expr that unwraps an implicit-parameter or overloaded-label dictionary to expose the underlying value. We expect the Expr to have the form `IP sym ty` or `IsLabel sym ty`, and return a Expr `co :: IP sym ty ~ ty` or `co :: IsLabel sym ty ~ ty`. See also Note [Type-checking overloaded labels] in GHC.Tc.Gen.Expr.

tcDowngradeRole :: Role -> Role -> TcCoercion -> TcCoercion

tcCoercionRole :: TcCoercion -> Role

tcCoercionKind :: TcCoercion -> Pair TcType

quoteWrapperTyVarTy :: QuoteWrapper -> Type

pprHsWrapper :: HsWrapper -> (Bool -> SDoc) -> SDoc

nonDetStrictFoldEvBindMap :: (EvBind -> a -> a) -> a -> EvBindMap -> a

mkWpTyLams :: [TyVar] -> HsWrapper

mkWpTyApps :: [Type] -> HsWrapper

mkWpLet :: TcEvBinds -> HsWrapper

mkWpLams :: [Var] -> HsWrapper

mkWpFun :: HsWrapper -> HsWrapper -> Scaled TcType -> TcType -> SDoc -> HsWrapper

mkWpEvVarApps :: [EvVar] -> HsWrapper

mkWpEvApps :: [EvTerm] -> HsWrapper

mkWpCastR :: TcCoercionR -> HsWrapper

mkWpCastN :: TcCoercionN -> HsWrapper

mkWantedEvBind :: EvVar -> EvTerm -> EvBind

mkTcUnbranchedAxInstCo :: CoAxiom Unbranched -> [TcType] -> [TcCoercion] -> TcCoercionR

mkTcTyConAppCo :: Role -> TyCon -> [TcCoercion] -> TcCoercion

mkTcTransCo :: TcCoercion -> TcCoercion -> TcCoercion

mkTcSymMCo :: TcMCoercion -> TcMCoercion

mkTcSymCo :: TcCoercion -> TcCoercion

mkTcSubCo :: HasDebugCallStack => TcCoercionN -> TcCoercionR

mkTcRepReflCo :: TcType -> TcCoercionR

mkTcReflCo :: Role -> TcType -> TcCoercion

mkTcPhantomCo :: TcCoercionN -> TcType -> TcType -> TcCoercionP

mkTcNthCo :: Role -> Int -> TcCoercion -> TcCoercion

mkTcNomReflCo :: TcType -> TcCoercionN

mkTcLRCo :: LeftOrRight -> TcCoercion -> TcCoercion

mkTcKindCo :: TcCoercion -> TcCoercionN

mkTcGReflRightMCo :: Role -> TcType -> TcMCoercionN -> TcCoercion

mkTcGReflRightCo :: Role -> TcType -> TcCoercionN -> TcCoercion

mkTcGReflLeftMCo :: Role -> TcType -> TcMCoercionN -> TcCoercion

mkTcGReflLeftCo :: Role -> TcType -> TcCoercionN -> TcCoercion

mkTcFunCo :: Role -> TcCoercion -> TcCoercion -> TcCoercion -> TcCoercion

mkTcForAllCos :: [(TyVar, TcCoercionN)] -> TcCoercion -> TcCoercion

mkTcForAllCo :: TyVar -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcFamilyTyConAppCo :: TyCon -> [TcCoercionN] -> TcCoercionN

mkTcCoherenceRightCo :: Role -> TcType -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcCoherenceLeftCo :: Role -> TcType -> TcCoercionN -> TcCoercion -> TcCoercion

mkTcCoVarCo :: CoVar -> TcCoercion

mkTcAxiomRuleCo :: CoAxiomRule -> [TcCoercion] -> TcCoercionR

mkTcAxInstCo :: forall (br :: BranchFlag). Role -> CoAxiom br -> BranchIndex -> [TcType] -> [TcCoercion] -> TcCoercion

mkTcAppCo :: TcCoercion -> TcCoercionN -> TcCoercion

mkGivenEvBind :: EvVar -> EvTerm -> EvBind

mkEvScSelectors :: Class -> [TcType] -> [(TcPredType, EvExpr)]

mkEvCast :: EvExpr -> TcCoercion -> EvTerm

maybeTcSymCo :: SwapFlag -> TcCoercion -> TcCoercion

If a SwapFlag is IsSwapped, flip the orientation of a coercion

maybeTcSubCo :: HasDebugCallStack => EqRel -> TcCoercionN -> TcCoercion

If the EqRel is ReprEq, makes a SubCo; otherwise, does nothing. Note that the input coercion should always be nominal.

lookupEvBind :: EvBindMap -> EvVar -> Maybe EvBind

isTcReflexiveCo :: TcCoercion -> Bool

This version does a slow check, calculating the related types and seeing if they are equal.

isTcReflCo :: TcCoercion -> Bool

isIdHsWrapper :: HsWrapper -> Bool

isEmptyTcEvBinds :: TcEvBinds -> Bool

isEmptyEvBindMap :: EvBindMap -> Bool

isCoEvBindsVar :: EvBindsVar -> Bool

idHsWrapper :: HsWrapper

hsWrapDictBinders :: HsWrapper -> Bag DictId

Identifies the lambda-bound dictionaries of an HsWrapper. This is used (only) to allow the pattern-match overlap checker to know what Given dictionaries are in scope.

We specifically do not collect dictionaries bound in a WpLet. These are either superclasses of lambda-bound ones, or (extremely numerous) results of binding Wanted dictionaries. We definitely don't want all those cluttering up the Given dictionaries for pattern-match overlap checking!

foldEvBindMap :: (EvBind -> a -> a) -> a -> EvBindMap -> a

findNeededEvVars :: EvBindMap -> VarSet -> VarSet

filterEvBindMap :: (EvBind -> Bool) -> EvBindMap -> EvBindMap

extendEvBinds :: EvBindMap -> EvBind -> EvBindMap

evVarsOfTerm :: EvTerm -> VarSet

evTypeable :: Type -> EvTypeable -> EvTerm

evTermCoercion_maybe :: EvTerm -> Maybe TcCoercion

evTermCoercion :: EvTerm -> TcCoercion

evSelector :: Id -> [Type] -> [EvExpr] -> EvExpr

evId :: EvId -> EvExpr

Any sort of evidence Id, including coercions

evDataConApp :: DataCon -> [Type] -> [EvExpr] -> EvTerm

evDFunApp :: DFunId -> [Type] -> [EvExpr] -> EvTerm

evCoercion :: TcCoercion -> EvTerm

evCast :: EvExpr -> TcCoercion -> EvTerm

d |> co

evBindVar :: EvBind -> EvVar

evBindMapToVarSet :: EvBindMap -> VarSet

evBindMapBinds :: EvBindMap -> Bag EvBind

emptyTcEvBinds :: TcEvBinds

emptyEvBindMap :: EvBindMap

collectHsWrapBinders :: HsWrapper -> ([Var], HsWrapper)

applyQuoteWrapper :: QuoteWrapper -> HsWrapper

Convert the QuoteWrapper into a normal HsWrapper which can be used to apply its contents.

data CoercionHole

A coercion to be filled in by the type-checker. See Note [Coercion holes]

Instances

Data CoercionHole

Defined in GHC.Core.TyCo.Rep

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> CoercionHole -> c CoercionHole

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c CoercionHole

toConstr :: CoercionHole -> Constr

dataTypeOf :: CoercionHole -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c CoercionHole)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c CoercionHole)

gmapT :: (forall b. Data b => b -> b) -> CoercionHole -> CoercionHole

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> CoercionHole -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> CoercionHole -> r

gmapQ :: (forall d. Data d => d -> u) -> CoercionHole -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> CoercionHole -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> CoercionHole -> m CoercionHole

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> CoercionHole -> m CoercionHole

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> CoercionHole -> m CoercionHole

Uniquable CoercionHole

Defined in GHC.Core.TyCo.Rep

Methods

getUnique :: CoercionHole -> Unique

Outputable CoercionHole

Defined in GHC.Core.TyCo.Rep

Methods

ppr :: CoercionHole -> SDoc

data Role

Constructors

Nominal

Representational

Phantom

Instances

Data Role

Defined in GHC.Core.Coercion.Axiom

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Role -> c Role

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Role

toConstr :: Role -> Constr

dataTypeOf :: Role -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Role)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Role)

gmapT :: (forall b. Data b => b -> b) -> Role -> Role

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Role -> r

gmapQ :: (forall d. Data d => d -> u) -> Role -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Role -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Role -> m Role

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Role -> m Role

Binary Role

Defined in GHC.Core.Coercion.Axiom

Methods

put_ :: BinHandle -> Role -> IO ()

put :: BinHandle -> Role -> IO (Bin Role)

get :: BinHandle -> IO Role

Outputable Role

Defined in GHC.Core.Coercion.Axiom

Methods

ppr :: Role -> SDoc

Eq Role

Defined in GHC.Core.Coercion.Axiom

Methods

(==) :: Role -> Role -> Bool

(/=) :: Role -> Role -> Bool

Ord Role

Defined in GHC.Core.Coercion.Axiom

Methods

compare :: Role -> Role -> Ordering

(<) :: Role -> Role -> Bool

(<=) :: Role -> Role -> Bool

(>) :: Role -> Role -> Bool

(>=) :: Role -> Role -> Bool

max :: Role -> Role -> Role

min :: Role -> Role -> Role

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

type Anno (Maybe Role)

Defined in GHC.Hs.Decls

type Anno (Maybe Role) = SrcSpan

data LeftOrRight

Constructors

CLeft

CRight

Instances

Data LeftOrRight

Defined in GHC.Types.Basic

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> LeftOrRight -> c LeftOrRight

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c LeftOrRight

toConstr :: LeftOrRight -> Constr

dataTypeOf :: LeftOrRight -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c LeftOrRight)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c LeftOrRight)

gmapT :: (forall b. Data b => b -> b) -> LeftOrRight -> LeftOrRight

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> LeftOrRight -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> LeftOrRight -> r

gmapQ :: (forall d. Data d => d -> u) -> LeftOrRight -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> LeftOrRight -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> LeftOrRight -> m LeftOrRight

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> LeftOrRight -> m LeftOrRight

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> LeftOrRight -> m LeftOrRight

Binary LeftOrRight

Defined in GHC.Types.Basic

Methods

put_ :: BinHandle -> LeftOrRight -> IO ()

put :: BinHandle -> LeftOrRight -> IO (Bin LeftOrRight)

get :: BinHandle -> IO LeftOrRight

Outputable LeftOrRight

Defined in GHC.Types.Basic

Methods

ppr :: LeftOrRight -> SDoc

Eq LeftOrRight

Defined in GHC.Types.Basic

Methods

(==) :: LeftOrRight -> LeftOrRight -> Bool

(/=) :: LeftOrRight -> LeftOrRight -> Bool

pickLR :: LeftOrRight -> (a, a) -> a

module GHC.Tc.Utils.Env

mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])

The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state monad.

foldrM :: (Foldable t, Monad m) => (a -> b -> m b) -> b -> t a -> m b

Right-to-left monadic fold over the elements of a structure.

Given a structure t with elements (a, b, c, ..., x, y), the result of a fold with an operator function f is equivalent to:

foldrM f z t = do
    yy <- f y z
    xx <- f x yy
    ...
    bb <- f b cc
    aa <- f a bb
    return aa -- Just @return z@ when the structure is empty

For a Monad m, given two functions f1 :: a -> m b and f2 :: b -> m c, their Kleisli composition (f1 >=> f2) :: a -> m c is defined by:

(f1 >=> f2) a = f1 a >>= f2

Another way of thinking about foldrM is that it amounts to an application to z of a Kleisli composition:

foldrM f z t = f y >=> f x >=> ... >=> f b >=> f a $ z

The monadic effects of foldrM are sequenced from right to left, and e.g. folds of infinite lists will diverge.

If at some step the bind operator (>>=) short-circuits (as with, e.g., mzero in a MonadPlus), the evaluated effects will be from a tail of the element sequence. If you want to evaluate the monadic effects in left-to-right order, or perhaps be able to short-circuit after an initial sequence of elements, you'll need to use foldlM instead.

If the monadic effects don't short-circuit, the outermost application of f is to the leftmost element a, so that, ignoring effects, the result looks like a right fold:

a `f` (b `f` (c `f` (... (x `f` (y `f` z))))).

Examples

Basic usage:

>>> let f i acc = do { print i ; return $ i : acc }
>>> foldrM f [] [0..3]
3
2
1
0
[0,1,2,3]

foldlM :: (Foldable t, Monad m) => (b -> a -> m b) -> b -> t a -> m b

Left-to-right monadic fold over the elements of a structure.

Given a structure t with elements (a, b, ..., w, x, y), the result of a fold with an operator function f is equivalent to:

foldlM f z t = do
    aa <- f z a
    bb <- f aa b
    ...
    xx <- f ww x
    yy <- f xx y
    return yy -- Just @return z@ when the structure is empty

For a Monad m, given two functions f1 :: a -> m b and f2 :: b -> m c, their Kleisli composition (f1 >=> f2) :: a -> m c is defined by:

(f1 >=> f2) a = f1 a >>= f2

Another way of thinking about foldlM is that it amounts to an application to z of a Kleisli composition:

foldlM f z t =
    flip f a >=> flip f b >=> ... >=> flip f x >=> flip f y $ z

The monadic effects of foldlM are sequenced from left to right.

If at some step the bind operator (>>=) short-circuits (as with, e.g., mzero in a MonadPlus), the evaluated effects will be from an initial segment of the element sequence. If you want to evaluate the monadic effects in right-to-left order, or perhaps be able to short-circuit after processing a tail of the sequence of elements, you'll need to use foldrM instead.

If the monadic effects don't short-circuit, the outermost application of f is to the rightmost element y, so that, ignoring effects, the result looks like a left fold:

((((z `f` a) `f` b) ... `f` w) `f` x) `f` y

Examples

Basic usage:

>>> let f a e = do { print e ; return $ e : a }
>>> foldlM f [] [0..3]
0
1
2
3
[3,2,1,0]

data IsExtraConstraint

Constructors

YesExtraConstraint

NoExtraConstraint

Instances

Outputable IsExtraConstraint

Defined in GHC.Tc.Utils.Monad

Methods

ppr :: IsExtraConstraint -> SDoc

xoptM :: Extension -> TcRnIf gbl lcl Bool

writeTcRef :: TcRef a -> a -> TcRnIf gbl lcl ()

wrapLocSndMA :: (a -> TcM (b, c)) -> LocatedA a -> TcM (b, LocatedA c)

wrapLocSndM :: (a -> TcM (b, c)) -> Located a -> TcM (b, Located c)

wrapLocM_ :: (a -> TcM ()) -> Located a -> TcM ()

wrapLocMA_ :: (a -> TcM ()) -> LocatedA a -> TcM ()

wrapLocMA :: (a -> TcM b) -> GenLocated (SrcSpanAnn' ann) a -> TcRn (GenLocated (SrcSpanAnn' ann) b)

wrapLocM :: (a -> TcM b) -> Located a -> TcM (Located b)

wrapLocFstMA :: (a -> TcM (b, c)) -> LocatedA a -> TcM (LocatedA b, c)

wrapLocFstM :: (a -> TcM (b, c)) -> Located a -> TcM (Located b, c)

wrapLocAM :: (a -> TcM b) -> LocatedAn an a -> TcM (Located b)

woptM :: WarningFlag -> TcRnIf gbl lcl Bool

withoutDynamicNow :: TcRnIf gbl lcl a -> TcRnIf gbl lcl a

withException :: TcRnIf gbl lcl (MaybeErr SDoc a) -> TcRnIf gbl lcl a

A convenient wrapper for taking a MaybeErr SDoc a and throwing an exception if it is an error.

withDynamicNow :: TcRnIf gbl lcl a -> TcRnIf gbl lcl a

whenXOptM :: Extension -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

whenWOptM :: WarningFlag -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

whenNoErrs :: TcM () -> TcM ()

whenGOptM :: GeneralFlag -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

whenDOptM :: DumpFlag -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

Do it flag is true

warnTcM :: WarnReason -> Bool -> (TidyEnv, SDoc) -> TcM ()

Display a warning if a condition is met.

warnTc :: WarnReason -> Bool -> SDoc -> TcM ()

Display a warning if a condition is met.

warnIfFlag :: WarningFlag -> Bool -> SDoc -> TcRn ()

Display a warning if a condition is met, and the warning is enabled

warnIf :: Bool -> SDoc -> TcRn ()

Display a warning if a condition is met.

updateEps_ :: (ExternalPackageState -> ExternalPackageState) -> TcRnIf gbl lcl ()

Update the external package state.

This is an atomic operation and forces evaluation of the modified EPS in order to avoid space leaks.

updateEps :: (ExternalPackageState -> (ExternalPackageState, a)) -> TcRnIf gbl lcl a

Update the external package state. Returns the second result of the modifier function.

This is an atomic operation and forces evaluation of the modified EPS in order to avoid space leaks.

updTopEnv :: (HscEnv -> HscEnv) -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

updTcRef :: TcRef a -> (a -> a) -> TcRnIf gbl lcl ()

updLclEnv :: (lcl -> lcl) -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

updGblEnv :: (gbl -> gbl) -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

unsetXOptM :: Extension -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

unsetWOptM :: WarningFlag -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

unsetGOptM :: GeneralFlag -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

unlessXOptM :: Extension -> TcRnIf gbl lcl () -> TcRnIf gbl lcl ()

tryTcDiscardingErrs :: TcM r -> TcM r -> TcM r

tryTc :: TcRn a -> TcRn (Maybe a, Messages DecoratedSDoc)

tryCaptureConstraints :: TcM a -> TcM (Maybe a, WantedConstraints)

traceTcConstraints :: String -> TcM ()

traceTc :: String -> SDoc -> TcRn ()

traceRn :: String -> SDoc -> TcRn ()

traceOptTcRn :: DumpFlag -> SDoc -> TcRn ()

traceOptIf :: DumpFlag -> SDoc -> TcRnIf m n ()

traceIf :: SDoc -> TcRnIf m n ()

traceHiDiffs :: SDoc -> TcRnIf m n ()

tcSelfBootInfo :: TcRn SelfBootInfo

tcScalingUsage :: Mult -> TcM a -> TcM a

tcScalingUsage mult thing_inside runs thing_inside and scales all the usage information by mult.

tcIsHsig :: TcRn Bool

tcIsHsBootOrSig :: TcRn Bool

tcEmitBindingUsage :: UsageEnv -> TcM ()

tcCollectingUsage :: TcM a -> TcM (UsageEnv, a)

tcCollectingUsage thing_inside runs thing_inside and returns the usage information which was collected as part of the execution of thing_inside. Careful: tcCollectingUsage thing_inside itself does not report any usage information, it's up to the caller to incorporate the returned usage information into the larger context appropriately.

setXOptM :: Extension -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

setTcLevel :: TcLevel -> TcM a -> TcM a

setTcEvBindsMap :: EvBindsVar -> EvBindMap -> TcM ()

setStage :: ThStage -> TcM a -> TcRn a

setSrcSpanA :: SrcSpanAnn' ann -> TcRn a -> TcRn a

setSrcSpan :: SrcSpan -> TcRn a -> TcRn a

setLocalRdrEnv :: LocalRdrEnv -> RnM a -> RnM a

setLclTypeEnv :: TcLclEnv -> TcM a -> TcM a

setLclEnv :: lcl' -> TcRnIf gbl lcl' a -> TcRnIf gbl lcl a

setImplicitEnvM :: TypeEnv -> IfL a -> IfL a

setGblEnv :: gbl -> TcRnIf gbl lcl a -> TcRnIf gbl lcl a

setErrsVar :: TcRef (Messages DecoratedSDoc) -> TcRn a -> TcRn a

setErrCtxt :: [ErrCtxt] -> TcM a -> TcM a

setEnvs :: (gbl', lcl') -> TcRnIf gbl' lcl' a -> TcRnIf gbl lcl a

setCtLocM :: CtLoc -> TcM a -> TcM a

setConstraintVar :: TcRef WantedConstraints -> TcM a -> TcM a

reportWarning :: WarnReason -> MsgEnvelope DecoratedSDoc -> TcRn ()

reportErrors :: [MsgEnvelope DecoratedSDoc] -> TcM ()

reportError :: MsgEnvelope DecoratedSDoc -> TcRn ()

recoverM :: TcRn r -> TcRn r -> TcRn r

recordUnsafeInfer :: WarningMessages -> TcM ()

Mark that safe inference has failed See Note [Safe Haskell Overlapping Instances Implementation] although this is used for more than just that failure case.

recordThUse :: TcM ()

recordThSpliceUse :: TcM ()

readTcRef :: TcRef a -> TcRnIf gbl lcl a

pushTcLevelsM :: Int -> TcM a -> TcM (a, TcLevel)

pushTcLevelM_ :: TcM a -> TcM a

pushTcLevelM :: TcM a -> TcM (TcLevel, a)

pushLevelAndCaptureConstraints :: TcM a -> TcM (TcLevel, WantedConstraints, a)

The name says it all. The returned TcLevel is the *inner* TcLevel.

printForUserTcRn :: SDoc -> TcRn ()

Like logInfoTcRn, but for user consumption

popErrCtxt :: TcM a -> TcM a

newUniqueSupply :: TcRnIf gbl lcl UniqSupply

newUnique :: TcRnIf gbl lcl Unique

newTcRef :: a -> TcRnIf gbl lcl (TcRef a)

newTcEvBinds :: TcM EvBindsVar

newSysName :: OccName -> TcRnIf gbl lcl Name

newSysLocalIds :: FastString -> [Scaled TcType] -> TcRnIf gbl lcl [TcId]

newSysLocalId :: FastString -> Mult -> TcType -> TcRnIf gbl lcl TcId

newNoTcEvBinds :: TcM EvBindsVar

Creates an EvBindsVar incapable of holding any bindings. It still tracks covar usages (see comments on ebv_tcvs in GHC.Tc.Types.Evidence), thus must be made monadically

newNameAt :: OccName -> SrcSpan -> TcM Name

newName :: OccName -> TcM Name

newArrowScope :: TcM a -> TcM a

mkLongErrAt :: SrcSpan -> SDoc -> SDoc -> TcRn (MsgEnvelope DecoratedSDoc)

mkIfLclEnv :: Module -> SDoc -> IsBootInterface -> IfLclEnv

mkErrInfo :: TidyEnv -> [ErrCtxt] -> TcM SDoc

mkDecoratedSDocAt

Arguments

:: SrcSpan

-> SDoc

The important part of the message

-> SDoc

The context of the message

-> SDoc

Any supplementary information.

-> TcRn (MsgEnvelope DecoratedSDoc)

mapAndReportM :: (a -> TcRn b) -> [a] -> TcRn [b]

Apply the function to all elements on the input list If all succeed, return the list of results Otherwise fail, propagating all errors

mapAndRecoverM :: (a -> TcRn b) -> [a] -> TcRn [b]

Drop elements of the input that fail, so the result list can be shorter than the argument list

keepAlive :: Name -> TcRn ()

isTouchableTcM :: TcTyVar -> TcM Bool

initTcWithGbl :: HscEnv -> TcGblEnv -> RealSrcSpan -> TcM r -> IO (Messages DecoratedSDoc, Maybe r)

Run a TcM action in the context of an existing GblEnv.

initTcRnIf

Arguments

:: Char

Mask for unique supply

-> HscEnv

-> gbl

-> lcl

-> TcRnIf gbl lcl a

-> IO a

initTcInteractive :: HscEnv -> TcM a -> IO (Messages DecoratedSDoc, Maybe a)

initTc :: HscEnv -> HscSource -> Bool -> Module -> RealSrcSpan -> TcM r -> IO (Messages DecoratedSDoc, Maybe r)

Setup the initial typechecking environment

initIfaceTcRn :: IfG a -> TcRn a

Run an IfG (top-level interface monad) computation inside an existing TcRn (typecheck-renaming monad) computation by initializing an IfGblEnv based on TcGblEnv.

initIfaceLoad :: HscEnv -> IfG a -> IO a

initIfaceLclWithSubst :: Module -> SDoc -> IsBootInterface -> NameShape -> IfL a -> IfM lcl a

Initialize interface typechecking, but with a NameShape to apply when typechecking top-level OccNames (see lookupIfaceTop)

initIfaceLcl :: Module -> SDoc -> IsBootInterface -> IfL a -> IfM lcl a

initIfaceCheck :: SDoc -> HscEnv -> IfG a -> IO a

inGeneratedCode :: TcRn Bool

ifErrsM :: TcRn r -> TcRn r -> TcRn r

goptM :: GeneralFlag -> TcRnIf gbl lcl Bool

getTopEnv :: TcRnIf gbl lcl HscEnv

getTcLevel :: TcM TcLevel

getTcEvTyCoVars :: EvBindsVar -> TcM TyCoVarSet

getTcEvBindsMap :: EvBindsVar -> TcM EvBindMap

getStageAndBindLevel :: Name -> TcRn (Maybe (TopLevelFlag, ThLevel, ThStage))

getStage :: TcM ThStage

getSrcSpanM :: TcRn SrcSpan

getRecFieldEnv :: TcRn RecFieldEnv

getRdrEnvs :: TcRn (GlobalRdrEnv, LocalRdrEnv)

getPrintUnqualified :: TcRn PrintUnqualified

getLocalRdrEnv :: RnM LocalRdrEnv

getLclTypeEnv :: TcM TcTypeEnv

getLclEnv :: TcRnIf gbl lcl lcl

getIsGHCi :: TcRn Bool

getInteractivePrintName :: TcRn Name

getImports :: TcRn ImportAvails

getIfModule :: IfL Module

getHpt :: TcRnIf gbl lcl HomePackageTable

getGlobalRdrEnv :: TcRn GlobalRdrEnv

getGhcMode :: TcRnIf gbl lcl GhcMode

getGblEnv :: TcRnIf gbl lcl gbl

getGHCiMonad :: TcRn Name

getFixityEnv :: TcRn FixityEnv

getErrsVar :: TcRn (TcRef (Messages DecoratedSDoc))

getErrCtxt :: TcM [ErrCtxt]

getEpsVar :: TcRnIf gbl lcl (TcRef ExternalPackageState)

getEpsAndHpt :: TcRnIf gbl lcl (ExternalPackageState, HomePackageTable)

getEps :: TcRnIf gbl lcl ExternalPackageState

getEnvs :: TcRnIf gbl lcl (gbl, lcl)

getDeclaredDefaultTys :: TcRn (Maybe [Type])

getCtLocM :: CtOrigin -> Maybe TypeOrKind -> TcM CtLoc

getConstraintVar :: TcM (TcRef WantedConstraints)

getCCIndexTcM :: FastString -> TcM CostCentreIndex

See getCCIndexM.

getCCIndexM :: (gbl -> TcRef CostCentreState) -> FastString -> TcRnIf gbl lcl CostCentreIndex

Get the next cost centre index associated with a given name.

forkM_maybe :: SDoc -> IfL a -> IfL (Maybe a)

Run thing_inside in an interleaved thread. It shares everything with the parent thread, so this is DANGEROUS.

It returns Nothing if the computation fails

It's used for lazily type-checking interface signatures, which is pretty benign.

See Note [Masking exceptions in forkM_maybe]

forkM :: SDoc -> IfL a -> IfL a

foldAndRecoverM :: (b -> a -> TcRn b) -> b -> [a] -> TcRn b

The accumulator is not updated if the action fails

fixSafeInstances :: SafeHaskellMode -> [ClsInst] -> [ClsInst]

Switch instances to safe instances if we're in Safe mode.

finalSafeMode :: DynFlags -> TcGblEnv -> IO SafeHaskellMode

Figure out the final correct safe haskell mode

failWithTcM :: (TidyEnv, SDoc) -> TcM a

failWithTc :: SDoc -> TcM a

failWith :: SDoc -> TcRn a

failIfTcM :: Bool -> (TidyEnv, SDoc) -> TcM ()

failIfTc :: Bool -> SDoc -> TcM ()

failIfM :: SDoc -> IfL a

failIfErrsM :: TcRn ()

failAt :: SrcSpan -> SDoc -> TcRn a

extendFixityEnv :: [(Name, FixItem)] -> RnM a -> RnM a

escapeArrowScope :: TcM a -> TcM a

emitStaticConstraints :: WantedConstraints -> TcM ()

emitSimples :: Cts -> TcM ()

emitSimple :: Ct -> TcM ()

emitNamedTypeHole :: (Name, TcTyVar) -> TcM ()

emitInsoluble :: Ct -> TcM ()

emitImplications :: Bag Implication -> TcM ()

emitImplication :: Implication -> TcM ()

emitHoles :: Bag Hole -> TcM ()

emitHole :: Hole -> TcM ()

emitConstraints :: WantedConstraints -> TcM ()

emitAnonTypeHole :: IsExtraConstraint -> TcTyVar -> TcM ()

dumpTcRn :: Bool -> DumpFlag -> String -> DumpFormat -> SDoc -> TcRn ()

Unconditionally dump some trace output

Certain tests (T3017, Roles3, T12763 etc.) expect part of the output generated by `-ddump-types` to be in PprUser style. However, generally we want all other debugging output to use PprDump style. We PprUser style if useUserStyle is True.

dumpOptTcRn :: DumpFlag -> String -> DumpFormat -> SDoc -> TcRn ()

Dump if the given DumpFlag is set.

doptM :: DumpFlag -> TcRnIf gbl lcl Bool

discardWarnings :: TcRn a -> TcRn a

discardResult :: TcM a -> TcM ()

discardErrs :: TcRn a -> TcRn a

discardConstraints :: TcM a -> TcM a

Throw out any constraints emitted by the thing_inside

debugTc :: TcM () -> TcM ()

cloneLocalName :: Name -> TcM Name

cloneEvBindsVar :: EvBindsVar -> TcM EvBindsVar

chooseUniqueOccTc :: (OccSet -> OccName) -> TcM OccName

checkTcM :: Bool -> (TidyEnv, SDoc) -> TcM ()

checkTc :: Bool -> SDoc -> TcM ()

checkNoErrs :: TcM r -> TcM r

checkErr :: Bool -> SDoc -> TcRn ()

captureConstraints :: TcM a -> TcM (a, WantedConstraints)

attemptM :: TcRn r -> TcRn (Maybe r)

askNoErrs :: TcRn a -> TcRn (a, Bool)

add_warn :: WarnReason -> SDoc -> SDoc -> TcRn ()

Display a warning, with an optional flag, for the current source location.

addWarnTcM :: WarnReason -> (TidyEnv, SDoc) -> TcM ()

Display a warning in a given context.

addWarnTc :: WarnReason -> SDoc -> TcM ()

Display a warning in the current context.

addWarnAt :: WarnReason -> SrcSpan -> SDoc -> TcRn ()

Display a warning for a given source location.

addWarn :: WarnReason -> SDoc -> TcRn ()

Display a warning for the current source location.

addTopEvBinds :: Bag EvBind -> TcM a -> TcM a

addTcEvBind :: EvBindsVar -> EvBind -> TcM ()

addModFinalizersWithLclEnv :: ThModFinalizers -> TcM ()

Adds the given modFinalizers to the global environment and set them to use the current local environment.

addMessages :: Messages DecoratedSDoc -> TcRn ()

addLongErrAt :: SrcSpan -> SDoc -> SDoc -> TcRn ()

addLocMA :: (a -> TcM b) -> GenLocated (SrcSpanAnn' ann) a -> TcM b

addLocM :: (a -> TcM b) -> Located a -> TcM b

addLandmarkErrCtxtM :: (TidyEnv -> TcM (TidyEnv, SDoc)) -> TcM a -> TcM a

Variant of addLandmarkErrCtxt that allows for monadic operations and tidying.

addLandmarkErrCtxt :: SDoc -> TcM a -> TcM a

Add a fixed landmark message to the error context. A landmark message is always sure to be reported, even if there is a lot of context. It also doesn't count toward the maximum number of contexts reported.

addErrs :: [(SrcSpan, SDoc)] -> TcRn ()

addErrTcM :: (TidyEnv, SDoc) -> TcM ()

addErrTc :: SDoc -> TcM ()

addErrCtxtM :: (TidyEnv -> TcM (TidyEnv, SDoc)) -> TcM a -> TcM a

Add a message to the error context. This message may do tidying.

addErrCtxt :: SDoc -> TcM a -> TcM a

Add a fixed message to the error context. This message should not do any tidying.

addErrAt :: SrcSpan -> SDoc -> TcRn ()

addErr :: SDoc -> TcRn ()

addDependentFiles :: [FilePath] -> TcRn ()

data WhereFrom

Constructors

ImportByUser IsBootInterface

ImportBySystem

ImportByPlugin

Instances

Outputable WhereFrom

Defined in GHC.Tc.Types

Methods

ppr :: WhereFrom -> SDoc

data ThStage

Constructors

Splice SpliceType

RunSplice (TcRef [ForeignRef (Q ())])

Comp

Brack ThStage PendingStuff

Instances

Outputable ThStage

Defined in GHC.Tc.Types

Methods

ppr :: ThStage -> SDoc

type ThLevel = Int

type TcTypeEnv = NameEnv TcTyThing

data TcTyThing

A typecheckable thing available in a local context. Could be AGlobal TyThing, but also lexically scoped variables, etc. See GHC.Tc.Utils.Env for how to retrieve a TyThing given a Name.

Constructors

AGlobal TyThing

ATcId

Fields

• tct_id :: TcId
• tct_info :: IdBindingInfo

ATyVar Name TcTyVar

ATcTyCon TyCon

APromotionErr PromotionErr

Instances

Outputable TcTyThing

Defined in GHC.Tc.Types

Methods

ppr :: TcTyThing -> SDoc

data TcSigInfo

Constructors

TcIdSig TcIdSigInfo

TcPatSynSig TcPatSynInfo

Instances

Outputable TcSigInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcSigInfo -> SDoc

type TcSigFun = Name -> Maybe TcSigInfo

type TcRnIf a b = IOEnv (Env a b)

type TcRn = TcRnIf TcGblEnv TcLclEnv

type TcRef a = IORef a

Type alias for IORef; the convention is we'll use this for mutable bits of data in TcGblEnv which are updated during typechecking and returned at the end.

type TcPluginSolver = [Ct] -> [Ct] -> [Ct] -> TcPluginM TcPluginResult

data TcPluginResult

Constructors

TcPluginContradiction [Ct]

The plugin found a contradiction. The returned constraints are removed from the inert set, and recorded as insoluble.

TcPluginOk [(EvTerm, Ct)] [Ct]

The first field is for constraints that were solved. These are removed from the inert set, and the evidence for them is recorded. The second field contains new work, that should be processed by the constraint solver.

data TcPluginM a

Instances

MonadFail TcPluginM

Defined in GHC.Tc.Types

Methods

fail :: String -> TcPluginM a

Applicative TcPluginM

Defined in GHC.Tc.Types

Methods

pure :: a -> TcPluginM a

(<*>) :: TcPluginM (a -> b) -> TcPluginM a -> TcPluginM b

liftA2 :: (a -> b -> c) -> TcPluginM a -> TcPluginM b -> TcPluginM c

(*>) :: TcPluginM a -> TcPluginM b -> TcPluginM b

(<*) :: TcPluginM a -> TcPluginM b -> TcPluginM a

Functor TcPluginM

Defined in GHC.Tc.Types

Methods

fmap :: (a -> b) -> TcPluginM a -> TcPluginM b

(<$) :: a -> TcPluginM b -> TcPluginM a

Monad TcPluginM

Defined in GHC.Tc.Types

Methods

(>>=) :: TcPluginM a -> (a -> TcPluginM b) -> TcPluginM b

(>>) :: TcPluginM a -> TcPluginM b -> TcPluginM b

return :: a -> TcPluginM a

data TcPlugin

Constructors

TcPlugin

Fields

• tcPluginInit :: TcPluginM s

  Initialize plugin, when entering type-checker.

• tcPluginSolve :: s -> TcPluginSolver

  Solve some constraints. TODO: WRITE MORE DETAILS ON HOW THIS WORKS.

• tcPluginStop :: s -> TcPluginM ()

  Clean up after the plugin, when exiting the type-checker.

data TcPatSynInfo

Constructors

TPSI

Fields

• patsig_name :: Name
• patsig_implicit_bndrs :: [InvisTVBinder]
• patsig_univ_bndrs :: [InvisTVBinder]
• patsig_req :: TcThetaType
• patsig_ex_bndrs :: [InvisTVBinder]
• patsig_prov :: TcThetaType
• patsig_body_ty :: TcSigmaType

Instances

Outputable TcPatSynInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcPatSynInfo -> SDoc

type TcM = TcRn

Historical "type-checking monad" (now it's just TcRn).

data TcIdSigInst

Constructors

TISI

Fields

• sig_inst_sig :: TcIdSigInfo
• sig_inst_skols :: [(Name, InvisTVBinder)]
• sig_inst_theta :: TcThetaType
• sig_inst_tau :: TcSigmaType
• sig_inst_wcs :: [(Name, TcTyVar)]
• sig_inst_wcx :: Maybe TcType

Instances

Outputable TcIdSigInst

Defined in GHC.Tc.Types

Methods

ppr :: TcIdSigInst -> SDoc

data TcIdSigInfo

Constructors

CompleteSig

Fields

• sig_bndr :: TcId
• sig_ctxt :: UserTypeCtxt
• sig_loc :: SrcSpan

PartialSig

Fields

• psig_name :: Name
• psig_hs_ty :: LHsSigWcType GhcRn
• sig_ctxt :: UserTypeCtxt
• sig_loc :: SrcSpan

Instances

Outputable TcIdSigInfo

Defined in GHC.Tc.Types

Methods

ppr :: TcIdSigInfo -> SDoc

type TcIdSet = IdSet

type TcId = Id

data TcGblEnv

TcGblEnv describes the top-level of the module at the point at which the typechecker is finished work. It is this structure that is handed on to the desugarer For state that needs to be updated during the typechecking phase and returned at end, use a TcRef (= IORef).

Constructors

TcGblEnv

Fields

• tcg_mod :: Module

  Module being compiled

• tcg_semantic_mod :: Module

  If a signature, the backing module See also Note [Identity versus semantic module]

• tcg_src :: HscSource

  What kind of module (regular Haskell, hs-boot, hsig)

• tcg_rdr_env :: GlobalRdrEnv

  Top level envt; used during renaming

• tcg_default :: Maybe [Type]

  Types used for defaulting. Nothing => no default decl

• tcg_fix_env :: FixityEnv

  Just for things in this module

• tcg_field_env :: RecFieldEnv

  Just for things in this module See Note [The interactive package] in GHC.Runtime.Context

• tcg_type_env :: TypeEnv

  Global type env for the module we are compiling now. All TyCons and Classes (for this module) end up in here right away, along with their derived constructors, selectors.

  (Ids defined in this module start in the local envt, though they move to the global envt during zonking)

  NB: for what "things in this module" means, see Note [The interactive package] in GHC.Runtime.Context

• tcg_type_env_var :: TcRef TypeEnv
• tcg_inst_env :: !InstEnv

  Instance envt for all home-package modules; Includes the dfuns in tcg_insts NB. BangPattern is to fix a leak, see #15111

• tcg_fam_inst_env :: !FamInstEnv

  Ditto for family instances NB. BangPattern is to fix a leak, see #15111

• tcg_ann_env :: AnnEnv

  And for annotations

• tcg_exports :: [AvailInfo]

  What is exported

• tcg_imports :: ImportAvails

  Information about what was imported from where, including things bound in this module. Also store Safe Haskell info here about transitive trusted package requirements.

  There are not many uses of this field, so you can grep for all them.

  The ImportAvails records information about the following things:

  1. All of the modules you directly imported (tcRnImports)
  2. The orphans (only!) of all imported modules in a GHCi session (runTcInteractive)
  3. The module that instantiated a signature
  4. Each of the signatures that merged in

  It is used in the following ways: - imp_orphs is used to determine what orphan modules should be visible in the context (tcVisibleOrphanMods) - imp_finsts is used to determine what family instances should be visible (tcExtendLocalFamInstEnv) - To resolve the meaning of the export list of a module (tcRnExports) - imp_mods is used to compute usage info (mkIfaceTc, deSugar) - imp_trust_own_pkg is used for Safe Haskell in interfaces (mkIfaceTc, as well as in GHC.Driver.Main) - To create the Dependencies field in interface (mkDependencies)

• tcg_dus :: DefUses
• tcg_used_gres :: TcRef [GlobalRdrElt]
• tcg_keep :: TcRef NameSet
• tcg_th_used :: TcRef Bool

  True <=> Template Haskell syntax used.

  We need this so that we can generate a dependency on the Template Haskell package, because the desugarer is going to emit loads of references to TH symbols. The reference is implicit rather than explicit, so we have to zap a mutable variable.

• tcg_th_splice_used :: TcRef Bool

  True <=> A Template Haskell splice was used.

  Splices disable recompilation avoidance (see #481)

• tcg_dfun_n :: TcRef OccSet

  Allows us to choose unique DFun names.

• tcg_merged :: [(Module, Fingerprint)]

  The requirements we merged with; we always have to recompile if any of these changed.

• tcg_rn_exports :: Maybe [(LIE GhcRn, Avails)]
• tcg_rn_imports :: [LImportDecl GhcRn]
• tcg_rn_decls :: Maybe (HsGroup GhcRn)

  Renamed decls, maybe. Nothing <=> Don't retain renamed decls.

• tcg_dependent_files :: TcRef [FilePath]

  dependencies from addDependentFile

• tcg_th_topdecls :: TcRef [LHsDecl GhcPs]

  Top-level declarations from addTopDecls

• tcg_th_foreign_files :: TcRef [(ForeignSrcLang, FilePath)]

  Foreign files emitted from TH.

• tcg_th_topnames :: TcRef NameSet

  Exact names bound in top-level declarations in tcg_th_topdecls

• tcg_th_modfinalizers :: TcRef [(TcLclEnv, ThModFinalizers)]

  Template Haskell module finalizers.

  They can use particular local environments.

• tcg_th_coreplugins :: TcRef [String]

  Core plugins added by Template Haskell code.

• tcg_th_state :: TcRef (Map TypeRep Dynamic)
• tcg_th_remote_state :: TcRef (Maybe (ForeignRef (IORef QState)))

  Template Haskell state

• tcg_th_docs :: TcRef THDocs

  Docs added in Template Haskell via putDoc.

• tcg_ev_binds :: Bag EvBind
• tcg_tr_module :: Maybe Id
• tcg_binds :: LHsBinds GhcTc
• tcg_sigs :: NameSet
• tcg_imp_specs :: [LTcSpecPrag]
• tcg_warns :: Warnings
• tcg_anns :: [Annotation]
• tcg_tcs :: [TyCon]
• tcg_ksigs :: NameSet
• tcg_insts :: [ClsInst]
• tcg_fam_insts :: [FamInst]
• tcg_rules :: [LRuleDecl GhcTc]
• tcg_fords :: [LForeignDecl GhcTc]
• tcg_patsyns :: [PatSyn]
• tcg_doc_hdr :: Maybe LHsDocString

  Maybe Haddock header docs

• tcg_hpc :: !AnyHpcUsage

  True if any part of the prog uses hpc instrumentation. NB. BangPattern is to fix a leak, see #15111

• tcg_self_boot :: SelfBootInfo

  Whether this module has a corresponding hi-boot file

• tcg_main :: Maybe Name

  The Name of the main function, if this module is the main module.

• tcg_safeInfer :: TcRef (Bool, WarningMessages)

  Has the typechecker inferred this module as -XSafe (Safe Haskell) See Note [Safe Haskell Overlapping Instances Implementation], although this is used for more than just that failure case.

• tcg_tc_plugins :: [TcPluginSolver]

  A list of user-defined plugins for the constraint solver.

• tcg_hf_plugins :: [HoleFitPlugin]

  A list of user-defined plugins for hole fit suggestions.

• tcg_top_loc :: RealSrcSpan

  The RealSrcSpan this module came from

• tcg_static_wc :: TcRef WantedConstraints

  Wanted constraints of static forms. See Note [Constraints in static forms].

• tcg_complete_matches :: !CompleteMatches

  Tracking indices for cost centre annotations

• tcg_cc_st :: TcRef CostCentreState

Instances

ContainsModule TcGblEnv

Defined in GHC.Tc.Types

Methods

extractModule :: TcGblEnv -> Module

type TcBinderStack = [TcBinder]

data TcBinder

Constructors

TcIdBndr TcId TopLevelFlag

TcIdBndr_ExpType Name ExpType TopLevelFlag

TcTvBndr Name TyVar

Instances

HasOccName TcBinder

Defined in GHC.Tc.Types

Methods

occName :: TcBinder -> OccName

Outputable TcBinder

Defined in GHC.Tc.Types

Methods

ppr :: TcBinder -> SDoc

type THDocs = Map DocLoc String

The current collection of docs that Template Haskell has built up via putDoc.

data SpliceType

Constructors

Typed

Untyped

data SelfBootInfo

Constructors

NoSelfBoot

SelfBoot

Fields

• sb_mds :: ModDetails
• sb_tcs :: NameSet

type RoleAnnotEnv = NameEnv (LRoleAnnotDecl GhcRn)

type RnM = TcRn

Historical "renaming monad" (now it's just TcRn).

type RhsNames = NameSet

type RecFieldEnv = NameEnv [FieldLabel]

data PromotionErr

Constructors

TyConPE

ClassPE

FamDataConPE

ConstrainedDataConPE PredType

PatSynPE

RecDataConPE

NoDataKindsTC

NoDataKindsDC

Instances

Outputable PromotionErr

Defined in GHC.Tc.Types

Methods

ppr :: PromotionErr -> SDoc

data PendingStuff

Constructors

RnPendingUntyped (TcRef [PendingRnSplice])

RnPendingTyped

TcPending (TcRef [PendingTcSplice]) (TcRef WantedConstraints) QuoteWrapper

data NameShape

A NameShape is a substitution on Names that can be used to refine the identities of a hole while we are renaming interfaces (see GHC.Iface.Rename). Specifically, a NameShape for ns_module_name A, defines a mapping from {A.T} (for some OccName T) to some arbitrary other Name.

The most intruiging thing about a NameShape, however, is how it's constructed. A NameShape is *implied* by the exported AvailInfos of the implementor of an interface: if an implementor of signature <H> exports M.T, you implicitly define a substitution from {H.T} to M.T. So a NameShape is computed from the list of AvailInfos that are exported by the implementation of a module, or successively merged together by the export lists of signatures which are joining together.

It's not the most obvious way to go about doing this, but it does seem to work!

NB: Can't boot this and put it in NameShape because then we start pulling in too many DynFlags things.

Constructors

NameShape

Fields

• ns_mod_name :: ModuleName
• ns_exports :: [AvailInfo]
• ns_map :: OccEnv Name

data IsGroupClosed

IsGroupClosed describes a group of mutually-recursive bindings

Constructors

IsGroupClosed (NameEnv RhsNames) ClosedTypeId

data ImportAvails

ImportAvails summarises what was imported from where, irrespective of whether the imported things are actually used or not. It is used:

• when processing the export list,
• when constructing usage info for the interface file,
• to identify the list of directly imported modules for initialisation purposes and for optimised overlap checking of family instances,
• when figuring out what things are really unused

Constructors

ImportAvails

Fields

• imp_mods :: ImportedMods

  Domain is all directly-imported modules

  See the documentation on ImportedModsVal in GHC.Unit.Module.Imported for the meaning of the fields.

  We need a full ModuleEnv rather than a ModuleNameEnv here, because we might be importing modules of the same name from different packages. (currently not the case, but might be in the future).

• imp_dep_mods :: ModuleNameEnv ModuleNameWithIsBoot

  Home-package modules needed by the module being compiled

  It doesn't matter whether any of these dependencies are actually used when compiling the module; they are listed if they are below it at all. For example, suppose M imports A which imports X. Then compiling M might not need to consult X.hi, but X is still listed in M's dependencies.

• imp_dep_pkgs :: Set UnitId

  Packages needed by the module being compiled, whether directly, or via other modules in this package, or via modules imported from other packages.

• imp_trust_pkgs :: Set UnitId

  This is strictly a subset of imp_dep_pkgs and records the packages the current module needs to trust for Safe Haskell compilation to succeed. A package is required to be trusted if we are dependent on a trustworthy module in that package. While perhaps making imp_dep_pkgs a tuple of (UnitId, Bool) where True for the bool indicates the package is required to be trusted is the more logical design, doing so complicates a lot of code not concerned with Safe Haskell. See Note [Tracking Trust Transitively] in GHC.Rename.Names

• imp_trust_own_pkg :: Bool

  Do we require that our own package is trusted? This is to handle efficiently the case where a Safe module imports a Trustworthy module that resides in the same package as it. See Note [Trust Own Package] in GHC.Rename.Names

• imp_orphs :: [Module]

  Orphan modules below us in the import tree (and maybe including us for imported modules)

• imp_finsts :: [Module]

  Family instance modules below us in the import tree (and maybe including us for imported modules)

type IfM lcl = TcRnIf IfGblEnv lcl

data IfLclEnv

Constructors

IfLclEnv

Fields

• if_mod :: Module
• if_boot :: IsBootInterface
• if_loc :: SDoc
• if_nsubst :: Maybe NameShape
• if_implicits_env :: Maybe TypeEnv
• if_tv_env :: FastStringEnv TyVar
• if_id_env :: FastStringEnv Id

type IfL = IfM IfLclEnv

data IfGblEnv

Constructors

IfGblEnv

Fields

• if_doc :: SDoc
• if_rec_types :: Maybe (Module, IfG TypeEnv)

type IfG = IfM ()

data IdBindingInfo

IdBindingInfo describes how an Id is bound.

It is used for the following purposes: a) for static forms in checkClosedInStaticForm and b) to figure out when a nested binding can be generalised, in decideGeneralisationPlan.

Constructors

NotLetBound

ClosedLet

NonClosedLet RhsNames ClosedTypeId

Instances

Outputable IdBindingInfo

Defined in GHC.Tc.Types

Methods

ppr :: IdBindingInfo -> SDoc

data FrontendResult

FrontendResult describes the result of running the frontend of a Haskell module. Currently one always gets a FrontendTypecheck, since running the frontend involves typechecking a program. hs-sig merges are not handled here.

This data type really should be in GHC.Driver.Env, but it needs to have a TcGblEnv which is only defined here.

Constructors

FrontendTypecheck TcGblEnv

type ErrCtxt = (Bool, TidyEnv -> TcM (TidyEnv, SDoc))

data Env gbl lcl

Constructors

Env

Fields

• env_top :: !HscEnv
• env_um :: !Char
• env_gbl :: gbl
• env_lcl :: lcl

Instances

ContainsHooks (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractHooks :: Env gbl lcl -> Hooks

ContainsDynFlags (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractDynFlags :: Env gbl lcl -> DynFlags

ContainsModule gbl => ContainsModule (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractModule :: Env gbl lcl -> Module

ContainsLogger (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractLogger :: Env gbl lcl -> Logger

data DocLoc

This is a mirror of Template Haskell's DocLoc, but the TH names are resolved to GHC names.

Constructors

DeclDoc Name

ArgDoc Name Int

InstDoc Name

ModuleDoc

Instances

Eq DocLoc

Defined in GHC.Tc.Types

Methods

(==) :: DocLoc -> DocLoc -> Bool

(/=) :: DocLoc -> DocLoc -> Bool

Ord DocLoc

Defined in GHC.Tc.Types

Methods

compare :: DocLoc -> DocLoc -> Ordering

(<) :: DocLoc -> DocLoc -> Bool

(<=) :: DocLoc -> DocLoc -> Bool

(>) :: DocLoc -> DocLoc -> Bool

(>=) :: DocLoc -> DocLoc -> Bool

max :: DocLoc -> DocLoc -> DocLoc

min :: DocLoc -> DocLoc -> DocLoc

type ClosedTypeId = Bool

data ArrowCtxt

Constructors

NoArrowCtxt

ArrowCtxt LocalRdrEnv (TcRef WantedConstraints)

unsafeTcPluginTcM :: TcM a -> TcPluginM a

This function provides an escape for direct access to the TcM monad. It should not be used lightly, and the provided TcPluginM API should be favoured instead.

topStage :: ThStage

topSpliceStage :: ThStage

topAnnStage :: ThStage

thLevel :: ThStage -> ThLevel

tcVisibleOrphanMods :: TcGblEnv -> ModuleSet

tcTyThingCategory :: TcTyThing -> String

runTcPluginM :: TcPluginM a -> EvBindsVar -> TcM a

removeBindingShadowing :: HasOccName a => [a] -> [a]

pushErrCtxtSameOrigin :: ErrCtxt -> CtLoc -> CtLoc

pushErrCtxt :: CtOrigin -> ErrCtxt -> CtLoc -> CtLoc

pprTcTyThingCategory :: TcTyThing -> SDoc

pprPECategory :: PromotionErr -> SDoc

plusImportAvails :: ImportAvails -> ImportAvails -> ImportAvails

Union two ImportAvails

This function is a key part of Import handling, basically for each import we create a separate ImportAvails structure and then union them all together with this function.

peCategory :: PromotionErr -> String

outerLevel :: ThLevel

modDepsElts :: ModuleNameEnv ModuleNameWithIsBoot -> [ModuleNameWithIsBoot]

mkRoleAnnotEnv :: [LRoleAnnotDecl GhcRn] -> RoleAnnotEnv

mkModDeps :: [ModuleNameWithIsBoot] -> ModuleNameEnv ModuleNameWithIsBoot

lookupRoleAnnot :: RoleAnnotEnv -> Name -> Maybe (LRoleAnnotDecl GhcRn)

lintGblEnv :: Logger -> DynFlags -> TcGblEnv -> TcM ()

Check the TcGblEnv for consistency. Currently, only checks axioms, but should check other aspects, too.

isPartialSig :: TcIdSigInst -> Bool

impLevel :: ThLevel

hasCompleteSig :: TcSigFun -> Name -> Bool

No signature or a partial signature

getRoleAnnots :: [Name] -> RoleAnnotEnv -> [LRoleAnnotDecl GhcRn]

getPlatform :: TcM Platform

Get target platform

getEvBindsTcPluginM :: TcPluginM EvBindsVar

Access the EvBindsVar carried by the TcPluginM during constraint solving. Returns Nothing if invoked during tcPluginInit or tcPluginStop.

emptyRoleAnnotEnv :: RoleAnnotEnv

emptyImportAvails :: ImportAvails

data TcLclEnv

Constructors

TcLclEnv

Fields

• tcl_loc :: RealSrcSpan
• tcl_ctxt :: [ErrCtxt]
• tcl_in_gen_code :: Bool
• tcl_tclvl :: TcLevel
• tcl_th_ctxt :: ThStage
• tcl_th_bndrs :: ThBindEnv
• tcl_arrow_ctxt :: ArrowCtxt
• tcl_rdr :: LocalRdrEnv
• tcl_env :: TcTypeEnv
• tcl_usage :: TcRef UsageEnv
• tcl_bndrs :: TcBinderStack
• tcl_lie :: TcRef WantedConstraints
• tcl_errs :: TcRef (Messages DecoratedSDoc)

setLclEnvTcLevel :: TcLclEnv -> TcLevel -> TcLclEnv

setLclEnvLoc :: TcLclEnv -> RealSrcSpan -> TcLclEnv

getLclEnvTcLevel :: TcLclEnv -> TcLevel

getLclEnvLoc :: TcLclEnv -> RealSrcSpan

data IOEnvFailure

Constructors

IOEnvFailure

Instances

Exception IOEnvFailure

Defined in GHC.Data.IOEnv

Methods

toException :: IOEnvFailure -> SomeException

fromException :: SomeException -> Maybe IOEnvFailure

displayException :: IOEnvFailure -> String

Show IOEnvFailure

Defined in GHC.Data.IOEnv

Methods

showsPrec :: Int -> IOEnvFailure -> ShowS

show :: IOEnvFailure -> String

showList :: [IOEnvFailure] -> ShowS

data IOEnv env a

Instances

MonadFail (IOEnv m)

Defined in GHC.Data.IOEnv

Methods

fail :: String -> IOEnv m a

MonadFix (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

mfix :: (a -> IOEnv env a) -> IOEnv env a

MonadIO (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

liftIO :: IO a -> IOEnv env a

Alternative (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

empty :: IOEnv env a

(<|>) :: IOEnv env a -> IOEnv env a -> IOEnv env a

some :: IOEnv env a -> IOEnv env [a]

many :: IOEnv env a -> IOEnv env [a]

Applicative (IOEnv m)

Defined in GHC.Data.IOEnv

Methods

pure :: a -> IOEnv m a

(<*>) :: IOEnv m (a -> b) -> IOEnv m a -> IOEnv m b

liftA2 :: (a -> b -> c) -> IOEnv m a -> IOEnv m b -> IOEnv m c

(*>) :: IOEnv m a -> IOEnv m b -> IOEnv m b

(<*) :: IOEnv m a -> IOEnv m b -> IOEnv m a

Functor (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

fmap :: (a -> b) -> IOEnv env a -> IOEnv env b

(<$) :: a -> IOEnv env b -> IOEnv env a

Monad (IOEnv m)

Defined in GHC.Data.IOEnv

Methods

(>>=) :: IOEnv m a -> (a -> IOEnv m b) -> IOEnv m b

(>>) :: IOEnv m a -> IOEnv m b -> IOEnv m b

return :: a -> IOEnv m a

MonadPlus (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

mzero :: IOEnv env a

mplus :: IOEnv env a -> IOEnv env a -> IOEnv env a

MonadCatch (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

catch :: Exception e => IOEnv env a -> (e -> IOEnv env a) -> IOEnv env a

MonadMask (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

mask :: ((forall a. IOEnv env a -> IOEnv env a) -> IOEnv env b) -> IOEnv env b

uninterruptibleMask :: ((forall a. IOEnv env a -> IOEnv env a) -> IOEnv env b) -> IOEnv env b

generalBracket :: IOEnv env a -> (a -> ExitCase b -> IOEnv env c) -> (a -> IOEnv env b) -> IOEnv env (b, c)

MonadThrow (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

throwM :: Exception e => e -> IOEnv env a

ContainsHooks env => HasHooks (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getHooks :: IOEnv env Hooks

ContainsDynFlags env => HasDynFlags (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getDynFlags :: IOEnv env DynFlags

ContainsModule env => HasModule (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getModule :: IOEnv env Module

ContainsLogger env => HasLogger (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getLogger :: IOEnv env Logger

writeMutVar :: IORef a -> a -> IOEnv env ()

updMutVarM :: IORef a -> (a -> IOEnv env a) -> IOEnv env ()

updMutVar :: IORef a -> (a -> a) -> IOEnv env ()

updEnv :: (env -> env') -> IOEnv env' a -> IOEnv env a

Perform a computation with an altered environment

unsafeInterleaveM :: IOEnv env a -> IOEnv env a

uninterruptibleMaskM_ :: IOEnv env a -> IOEnv env a

tryMostM :: IOEnv env r -> IOEnv env (Either SomeException r)

tryM :: IOEnv env r -> IOEnv env (Either IOEnvFailure r)

tryAllM :: IOEnv env r -> IOEnv env (Either SomeException r)

setEnv :: env' -> IOEnv env' a -> IOEnv env a

Perform a computation with a different environment

runIOEnv :: env -> IOEnv env a -> IO a

readMutVar :: IORef a -> IOEnv env a

newMutVar :: a -> IOEnv env (IORef a)

getEnv :: IOEnv env env

fixM :: (a -> IOEnv env a) -> IOEnv env a

failWithM :: String -> IOEnv env a

failM :: IOEnv env a

atomicUpdMutVar' :: IORef a -> (a -> (a, b)) -> IOEnv env b

Strict variant of atomicUpdMutVar.

atomicUpdMutVar :: IORef a -> (a -> (a, b)) -> IOEnv env b

Atomically update the reference. Does not force the evaluation of the new variable contents. For strict update, use atomicUpdMutVar'.

type CompleteMatches = [CompleteMatch]

data CompleteMatch

A list of conlikes which represents a complete pattern match. These arise from COMPLETE signatures. See also Note [Implementation of COMPLETE pragmas].

Instances

Outputable CompleteMatch

Defined in GHC.Types.CompleteMatch

Methods

ppr :: CompleteMatch -> SDoc

zipWithAndUnzipM :: Monad m => (a -> b -> m (c, d)) -> [a] -> [b] -> m ([c], [d])

zipWith4M :: Monad m => (a -> b -> c -> d -> m e) -> [a] -> [b] -> [c] -> [d] -> m [e]

zipWith3M_ :: Monad m => (a -> b -> c -> m d) -> [a] -> [b] -> [c] -> m ()

zipWith3M :: Monad m => (a -> b -> c -> m d) -> [a] -> [b] -> [c] -> m [d]

whenM :: Monad m => m Bool -> m () -> m ()

Monadic version of when, taking the condition in the monad

unlessM :: Monad m => m Bool -> m () -> m ()

Monadic version of unless, taking the condition in the monad

orM :: Monad m => m Bool -> m Bool -> m Bool

Monadic version of or

maybeMapM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b)

Monadic version of fmap specialised for Maybe

mapSndM :: Monad m => (b -> m c) -> [(a, b)] -> m [(a, c)]

Monadic version of mapSnd

mapAndUnzip5M :: Monad m => (a -> m (b, c, d, e, f)) -> [a] -> m ([b], [c], [d], [e], [f])

mapAndUnzip4M :: Monad m => (a -> m (b, c, d, e)) -> [a] -> m ([b], [c], [d], [e])

mapAndUnzip3M :: Monad m => (a -> m (b, c, d)) -> [a] -> m ([b], [c], [d])

mapAndUnzipM for triples

mapAccumLM

Arguments

:: Monad m

=> (acc -> x -> m (acc, y))

combining function

-> acc

initial state

-> [x]

inputs

-> m (acc, [y])

final state, outputs

Monadic version of mapAccumL

liftSndM :: Monad m => (a -> b) -> m (r, a) -> m (r, b)

liftFstM :: Monad m => (a -> b) -> m (a, r) -> m (b, r)

foldlM_ :: (Monad m, Foldable t) => (a -> b -> m a) -> a -> t b -> m ()

Monadic version of foldl that discards its result

fmapMaybeM :: Monad m => (a -> m b) -> Maybe a -> m (Maybe b)

Monadic version of fmap

fmapEitherM :: Monad m => (a -> m b) -> (c -> m d) -> Either a c -> m (Either b d)

Monadic version of fmap

filterOutM :: Applicative m => (a -> m Bool) -> [a] -> m [a]

Like filterM, only it reverses the sense of the test.

data ForeignSrcLang

Foreign formats supported by GHC via TH

Constructors

LangC

C

LangCxx

C++

LangObjc

Objective C

LangObjcxx

Objective C++

LangAsm

Assembly language (.s)

RawObject

Object (.o)

Instances

Generic ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

Associated Types

type Rep ForeignSrcLang :: Type -> Type

Methods

from :: ForeignSrcLang -> Rep ForeignSrcLang x

to :: Rep ForeignSrcLang x -> ForeignSrcLang

Show ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

Methods

showsPrec :: Int -> ForeignSrcLang -> ShowS

show :: ForeignSrcLang -> String

showList :: [ForeignSrcLang] -> ShowS

Eq ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

Methods

(==) :: ForeignSrcLang -> ForeignSrcLang -> Bool

(/=) :: ForeignSrcLang -> ForeignSrcLang -> Bool

type Rep ForeignSrcLang

Defined in GHC.ForeignSrcLang.Type

type Rep ForeignSrcLang = D1 ('MetaData "ForeignSrcLang" "GHC.ForeignSrcLang.Type" "ghc-boot-th-9.2.4" 'False) ((C1 ('MetaCons "LangC" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "LangCxx" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LangObjc" 'PrefixI 'False) (U1 :: Type -> Type))) :+: (C1 ('MetaCons "LangObjcxx" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "LangAsm" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RawObject" 'PrefixI 'False) (U1 :: Type -> Type))))

module GHC.Types.Basic

module GHC.Types.Id

data BuiltInSyntax

BuiltInSyntax is for things like (:), [] and tuples, which have special syntactic forms. They aren't in scope as such.

Constructors

BuiltInSyntax

UserSyntax

wiredInNameTyThing_maybe :: Name -> Maybe TyThing

stableNameCmp :: Name -> Name -> Ordering

Compare Names lexicographically This only works for Names that originate in the source code or have been tidied.

setNameLoc :: Name -> SrcSpan -> Name

pprPrefixName :: NamedThing a => a -> SDoc

pprNameUnqualified :: Name -> SDoc

Print the string of Name unqualifiedly directly.

pprNameDefnLoc :: Name -> SDoc

pprModulePrefix :: PprStyle -> Module -> OccName -> SDoc

pprInfixName :: (Outputable a, NamedThing a) => a -> SDoc

pprDefinedAt :: Name -> SDoc

nameStableString :: Name -> String

Get a string representation of a Name that's unique and stable across recompilations. Used for deterministic generation of binds for derived instances. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal$String"

nameSrcSpan :: Name -> SrcSpan

nameSrcLoc :: Name -> SrcLoc

nameNameSpace :: Name -> NameSpace

nameModule_maybe :: Name -> Maybe Module

nameModule :: HasDebugCallStack => Name -> Module

nameIsLocalOrFrom :: Module -> Name -> Bool

Returns True if the name is (a) Internal (b) External but from the specified module (c) External but from the interactive package

The key idea is that False means: the entity is defined in some other module you can find the details (type, fixity, instances) in some interface file those details will be stored in the EPT or HPT

True means: the entity is defined in this module or earlier in the GHCi session you can find details (type, fixity, instances) in the TcGblEnv or TcLclEnv

The isInteractiveModule part is because successive interactions of a GHCi session each give rise to a fresh module (Ghci1, Ghci2, etc), but they all come from the magic interactive package; and all the details are kept in the TcLclEnv, TcGblEnv, NOT in the HPT or EPT. See Note [The interactive package] in GHC.Runtime.Context

nameIsHomePackageImport :: Module -> Name -> Bool

nameIsHomePackage :: Module -> Name -> Bool

nameIsFromExternalPackage :: HomeUnit -> Name -> Bool

Returns True if the Name comes from some other package: neither this package nor the interactive package.

mkWiredInName :: Module -> OccName -> Unique -> TyThing -> BuiltInSyntax -> Name

Create a name which is actually defined by the compiler itself

mkSystemVarName :: Unique -> FastString -> Name

mkSystemNameAt :: Unique -> OccName -> SrcSpan -> Name

mkSystemName :: Unique -> OccName -> Name

Create a name brought into being by the compiler

mkSysTvName :: Unique -> FastString -> Name

mkInternalName :: Unique -> OccName -> SrcSpan -> Name

Create a name which is (for now at least) local to the current module and hence does not need a Module to disambiguate it from other Names

mkFCallName :: Unique -> String -> Name

Make a name for a foreign call

mkExternalName :: Unique -> Module -> OccName -> SrcSpan -> Name

Create a name which definitely originates in the given module

mkDerivedInternalName :: (OccName -> OccName) -> Unique -> Name -> Name

mkClonedInternalName :: Unique -> Name -> Name

localiseName :: Name -> Name

Make the Name into an internal name, regardless of what it was to begin with

isWiredInName :: Name -> Bool

isWiredIn :: NamedThing thing => thing -> Bool

isVarName :: Name -> Bool

isValName :: Name -> Bool

isTyVarName :: Name -> Bool

isTyConName :: Name -> Bool

isSystemName :: Name -> Bool

isInternalName :: Name -> Bool

isHoleName :: Name -> Bool

isExternalName :: Name -> Bool

isDynLinkName :: Platform -> Module -> Name -> Bool

Will the Name come from a dynamically linked package?

isDataConName :: Name -> Bool

isBuiltInSyntax :: Name -> Bool

getSrcSpan :: NamedThing a => a -> SrcSpan

getSrcLoc :: NamedThing a => a -> SrcLoc

getOccString :: NamedThing a => a -> String

getOccFS :: NamedThing a => a -> FastString

type TidyOccEnv = UniqFM FastString Int

type OccSet = UniqSet OccName

data OccEnv a

Instances

Data a => Data (OccEnv a)

Defined in GHC.Types.Name.Occurrence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OccEnv a -> c (OccEnv a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (OccEnv a)

toConstr :: OccEnv a -> Constr

dataTypeOf :: OccEnv a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (OccEnv a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (OccEnv a))

gmapT :: (forall b. Data b => b -> b) -> OccEnv a -> OccEnv a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OccEnv a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OccEnv a -> r

gmapQ :: (forall d. Data d => d -> u) -> OccEnv a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> OccEnv a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> OccEnv a -> m (OccEnv a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OccEnv a -> m (OccEnv a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OccEnv a -> m (OccEnv a)

Outputable a => Outputable (OccEnv a)

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccEnv a -> SDoc

data NameSpace

Instances

Binary NameSpace

Defined in GHC.Types.Name.Occurrence

Methods

put_ :: BinHandle -> NameSpace -> IO ()

put :: BinHandle -> NameSpace -> IO (Bin NameSpace)

get :: BinHandle -> IO NameSpace

Eq NameSpace

Defined in GHC.Types.Name.Occurrence

Methods

(==) :: NameSpace -> NameSpace -> Bool

(/=) :: NameSpace -> NameSpace -> Bool

Ord NameSpace

Defined in GHC.Types.Name.Occurrence

Methods

compare :: NameSpace -> NameSpace -> Ordering

(<) :: NameSpace -> NameSpace -> Bool

(<=) :: NameSpace -> NameSpace -> Bool

(>) :: NameSpace -> NameSpace -> Bool

(>=) :: NameSpace -> NameSpace -> Bool

max :: NameSpace -> NameSpace -> NameSpace

min :: NameSpace -> NameSpace -> NameSpace

unitOccSet :: OccName -> OccSet

unitOccEnv :: OccName -> a -> OccEnv a

unionOccSets :: OccSet -> OccSet -> OccSet

unionManyOccSets :: [OccSet] -> OccSet

tvName :: NameSpace

tidyOccName :: TidyOccEnv -> OccName -> (TidyOccEnv, OccName)

tcName :: NameSpace

tcClsName :: NameSpace

startsWithUnderscore :: OccName -> Bool

Haskell 98 encourages compilers to suppress warnings about unused names in a pattern if they start with _: this implements that test

srcDataName :: NameSpace

setOccNameSpace :: NameSpace -> OccName -> OccName

promoteOccName :: OccName -> Maybe OccName

pprOccName :: OccName -> SDoc

pprOccEnv :: (a -> SDoc) -> OccEnv a -> SDoc

pprNonVarNameSpace :: NameSpace -> SDoc

pprNameSpaceBrief :: NameSpace -> SDoc

pprNameSpace :: NameSpace -> SDoc

plusOccEnv_C :: (a -> a -> a) -> OccEnv a -> OccEnv a -> OccEnv a

plusOccEnv :: OccEnv a -> OccEnv a -> OccEnv a

parenSymOcc :: OccName -> SDoc -> SDoc

Wrap parens around an operator

occEnvElts :: OccEnv a -> [a]

nameSpacesRelated :: NameSpace -> NameSpace -> Bool

mkWorkerOcc :: OccName -> OccName

mkVarOcc :: String -> OccName

mkTyVarOccFS :: FastString -> OccName

mkTyVarOcc :: String -> OccName

mkTyConRepOcc :: OccName -> OccName

mkTcOccFS :: FastString -> OccName

mkTcOcc :: String -> OccName

mkTag2ConOcc :: OccName -> OccName

mkSuperDictSelOcc

Arguments

:: Int

Index of superclass, e.g. 3

-> OccName

Class, e.g. Ord

-> OccName

Derived Occname, e.g. $p3Ord

mkSuperDictAuxOcc :: Int -> OccName -> OccName

mkSpecOcc :: OccName -> OccName

mkRepEqOcc :: OccName -> OccName

mkOccSet :: [OccName] -> OccSet

mkOccNameFS :: NameSpace -> FastString -> OccName

mkOccName :: NameSpace -> String -> OccName

mkOccEnv_C :: (a -> a -> a) -> [(OccName, a)] -> OccEnv a

mkOccEnv :: [(OccName, a)] -> OccEnv a

mkNewTyCoOcc :: OccName -> OccName

mkMethodOcc :: OccName -> OccName

mkMaxTagOcc :: OccName -> OccName

mkMatcherOcc :: OccName -> OccName

mkLocalOcc

Arguments

:: Unique

Unique to combine with the OccName

-> OccName

Local name, e.g. sat

-> OccName

Nice unique version, e.g. $L23sat

mkInstTyTcOcc

Arguments

:: String

Family name, e.g. Map

-> OccSet

avoid these Occs

-> OccName

R:Map

Derive a name for the representation type constructor of a data/newtype instance.

mkInstTyCoOcc :: OccName -> OccName

mkIPOcc :: OccName -> OccName

mkGenR :: OccName -> OccName

mkGen1R :: OccName -> OccName

mkForeignExportOcc :: OccName -> OccName

mkEqPredCoOcc :: OccName -> OccName

mkDictOcc :: OccName -> OccName

mkDefaultMethodOcc :: OccName -> OccName

mkDataTOcc :: OccName -> OccName

mkDataOccFS :: FastString -> OccName

mkDataOcc :: String -> OccName

mkDataConWrapperOcc :: OccName -> OccName

mkDataConWorkerOcc :: OccName -> OccName

mkDataCOcc :: OccName -> OccName

mkDFunOcc

Arguments

:: String

Typically the class and type glommed together e.g. OrdMaybe. Only used in debug mode, for extra clarity

-> Bool

Is this a hs-boot instance DFun?

-> OccSet

avoid these Occs

-> OccName

E.g. $f3OrdMaybe

mkCon2TagOcc :: OccName -> OccName

mkClsOccFS :: FastString -> OccName

mkClsOcc :: String -> OccName

mkClassOpAuxOcc :: OccName -> OccName

mkClassDataConOcc :: OccName -> OccName

mkBuilderOcc :: OccName -> OccName

minusOccSet :: OccSet -> OccSet -> OccSet

mapOccEnv :: (a -> b) -> OccEnv a -> OccEnv b

lookupOccEnv :: OccEnv a -> OccName -> Maybe a

isVarOcc :: OccName -> Bool

isVarNameSpace :: NameSpace -> Bool

isValOcc :: OccName -> Bool

Value OccNamess are those that are either in the variable or data constructor namespaces

isValNameSpace :: NameSpace -> Bool

isTypeableBindOcc :: OccName -> Bool

Is an OccName one of a Typeable TyCon or Module binding? This is needed as these bindings are renamed differently. See Note [Grand plan for Typeable] in GHC.Tc.Instance.Typeable.

isTvOcc :: OccName -> Bool

isTvNameSpace :: NameSpace -> Bool

isTcOcc :: OccName -> Bool

isTcClsNameSpace :: NameSpace -> Bool

isSymOcc :: OccName -> Bool

Test if the OccName is that for any operator (whether it is a data constructor or variable or whatever)

isEmptyOccSet :: OccSet -> Bool

isDerivedOccName :: OccName -> Bool

Test for definitions internally generated by GHC. This predicate is used to suppress printing of internal definitions in some debug prints

isDefaultMethodOcc :: OccName -> Bool

isDataSymOcc :: OccName -> Bool

Test if the OccName is a data constructor that starts with a symbol (e.g. :, or [])

isDataOcc :: OccName -> Bool

isDataConNameSpace :: NameSpace -> Bool

intersectOccSet :: OccSet -> OccSet -> OccSet

initTidyOccEnv :: [OccName] -> TidyOccEnv

foldOccEnv :: (a -> b -> b) -> b -> OccEnv a -> b

filterOccSet :: (OccName -> Bool) -> OccSet -> OccSet

filterOccEnv :: (elt -> Bool) -> OccEnv elt -> OccEnv elt

extendOccSetList :: OccSet -> [OccName] -> OccSet

extendOccSet :: OccSet -> OccName -> OccSet

extendOccEnv_C :: (a -> a -> a) -> OccEnv a -> OccName -> a -> OccEnv a

extendOccEnv_Acc :: (a -> b -> b) -> (a -> b) -> OccEnv b -> OccName -> a -> OccEnv b

extendOccEnvList :: OccEnv a -> [(OccName, a)] -> OccEnv a

extendOccEnv :: OccEnv a -> OccName -> a -> OccEnv a

emptyTidyOccEnv :: TidyOccEnv

emptyOccSet :: OccSet

emptyOccEnv :: OccEnv a

elemOccSet :: OccName -> OccSet -> Bool

elemOccEnv :: OccName -> OccEnv a -> Bool

demoteOccName :: OccName -> Maybe OccName

delTidyOccEnvList :: TidyOccEnv -> [FastString] -> TidyOccEnv

delListFromOccEnv :: OccEnv a -> [OccName] -> OccEnv a

delFromOccEnv :: OccEnv a -> OccName -> OccEnv a

dataName :: NameSpace

clsName :: NameSpace

avoidClashesOccEnv :: TidyOccEnv -> [OccName] -> TidyOccEnv

alterOccEnv :: (Maybe elt -> Maybe elt) -> OccEnv elt -> OccName -> OccEnv elt

class NamedThing a where

A class allowing convenient access to the Name of various datatypes

Minimal complete definition

getName

Methods

getOccName :: a -> OccName

getName :: a -> Name

Instances

NamedThing Class

Defined in GHC.Core.Class

Methods

getOccName :: Class -> OccName

getName :: Class -> Name

NamedThing ConLike

Defined in GHC.Core.ConLike

Methods

getOccName :: ConLike -> OccName

getName :: ConLike -> Name

NamedThing DataCon

Defined in GHC.Core.DataCon

Methods

getOccName :: DataCon -> OccName

getName :: DataCon -> Name

NamedThing FamInst

Defined in GHC.Core.FamInstEnv

Methods

getOccName :: FamInst -> OccName

getName :: FamInst -> Name

NamedThing ClsInst

Defined in GHC.Core.InstEnv

Methods

getOccName :: ClsInst -> OccName

getName :: ClsInst -> Name

NamedThing PatSyn

Defined in GHC.Core.PatSyn

Methods

getOccName :: PatSyn -> OccName

getName :: PatSyn -> Name

NamedThing TyCon

Defined in GHC.Core.TyCon

Methods

getOccName :: TyCon -> OccName

getName :: TyCon -> Name

NamedThing IfaceClassOp

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceClassOp -> OccName

getName :: IfaceClassOp -> Name

NamedThing IfaceConDecl

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceConDecl -> OccName

getName :: IfaceConDecl -> Name

NamedThing IfaceDecl

Defined in GHC.Iface.Syntax

Methods

getOccName :: IfaceDecl -> OccName

getName :: IfaceDecl -> Name

NamedThing HoleFitCandidate

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

getOccName :: HoleFitCandidate -> OccName

getName :: HoleFitCandidate -> Name

NamedThing Name

Defined in GHC.Types.Name

Methods

getOccName :: Name -> OccName

getName :: Name -> Name

NamedThing TyThing

Defined in GHC.Types.TyThing

Methods

getOccName :: TyThing -> OccName

getName :: TyThing -> Name

NamedThing Var

Defined in GHC.Types.Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

NamedThing (CoAxiom br)

Defined in GHC.Core.Coercion.Axiom

Methods

getOccName :: CoAxiom br -> OccName

getName :: CoAxiom br -> Name

NamedThing e => NamedThing (Located e)

Defined in GHC.Types.Name

Methods

getOccName :: Located e -> OccName

getName :: Located e -> Name

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

NamedThing tv => NamedThing (VarBndr tv flag)

Defined in GHC.Types.Var

Methods

getOccName :: VarBndr tv flag -> OccName

getName :: VarBndr tv flag -> Name

data Name

A unique, unambiguous name for something, containing information about where that thing originated.

Instances

Data Name

Defined in GHC.Types.Name

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Name -> c Name

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Name

toConstr :: Name -> Constr

dataTypeOf :: Name -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Name)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Name)

gmapT :: (forall b. Data b => b -> b) -> Name -> Name

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Name -> r

gmapQ :: (forall d. Data d => d -> u) -> Name -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Name -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Name -> m Name

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Name -> m Name

NFData Name

Defined in GHC.Types.Name

Methods

rnf :: Name -> ()

NamedThing Name

Defined in GHC.Types.Name

Methods

getOccName :: Name -> OccName

getName :: Name -> Name

HasOccName Name

Defined in GHC.Types.Name

Methods

occName :: Name -> OccName

Uniquable Name

Defined in GHC.Types.Name

Methods

getUnique :: Name -> Unique

Binary Name

Assumes that the Name is a non-binding one. See putIfaceTopBndr and getIfaceTopBndr for serializing binding Names. See UserData for the rationale for this distinction.

Defined in GHC.Types.Name

Methods

put_ :: BinHandle -> Name -> IO ()

put :: BinHandle -> Name -> IO (Bin Name)

get :: BinHandle -> IO Name

Outputable Name

Defined in GHC.Types.Name

Methods

ppr :: Name -> SDoc

OutputableBndr Name

Defined in GHC.Types.Name

Methods

pprBndr :: BindingSite -> Name -> SDoc

pprPrefixOcc :: Name -> SDoc

pprInfixOcc :: Name -> SDoc

bndrIsJoin_maybe :: Name -> Maybe Int

Eq Name

The same comments as for Name's Ord instance apply.

Defined in GHC.Types.Name

Methods

(==) :: Name -> Name -> Bool

(/=) :: Name -> Name -> Bool

Ord Name

Caution: This instance is implemented via nonDetCmpUnique, which means that the ordering is not stable across deserialization or rebuilds.

See nonDetCmpUnique for further information, and trac #15240 for a bug caused by improper use of this instance.

Defined in GHC.Types.Name

Methods

compare :: Name -> Name -> Ordering

(<) :: Name -> Name -> Bool

(<=) :: Name -> Name -> Bool

(>) :: Name -> Name -> Bool

(>=) :: Name -> Name -> Bool

max :: Name -> Name -> Name

min :: Name -> Name -> Name

ModifyState Name

Defined in Compat.HieAst

Methods

addSubstitution :: Name -> Name -> HieState -> HieState

ToHie (LBooleanFormula (LocatedN Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]

ToHie (Context (Located Name))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Name) -> HieM [HieAST Type]

ToHie (IEContext (LIEWrappedName Name))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIEWrappedName Name) -> HieM [HieAST Type]

type Anno Name

Defined in GHC.Hs.Extension

type Anno Name = SrcSpanAnnN

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

tidyNameOcc :: Name -> OccName -> Name

setNameUnique :: Name -> Unique -> Name

nameUnique :: Name -> Unique

nameOccName :: Name -> OccName

type FastStringEnv a = UniqFM FastString a

A non-deterministic set of FastStrings. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM for explanation why it's not deterministic and why it matters. Use DFastStringEnv if the set eventually gets converted into a list or folded over in a way where the order changes the generated code.

mkFsEnv :: [(FastString, a)] -> FastStringEnv a

lookupFsEnv :: FastStringEnv a -> FastString -> Maybe a

extendFsEnv :: FastStringEnv a -> FastString -> a -> FastStringEnv a

emptyFsEnv :: FastStringEnv a

data OccName

Occurrence Name

In this context that means: "classified (i.e. as a type name, value name, etc) but not qualified and not yet resolved"

Instances

Data OccName

Defined in GHC.Types.Name.Occurrence

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> OccName -> c OccName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c OccName

toConstr :: OccName -> Constr

dataTypeOf :: OccName -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c OccName)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c OccName)

gmapT :: (forall b. Data b => b -> b) -> OccName -> OccName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> OccName -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> OccName -> r

gmapQ :: (forall d. Data d => d -> u) -> OccName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> OccName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> OccName -> m OccName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> OccName -> m OccName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> OccName -> m OccName

Show OccName

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> OccName -> ShowS

show :: OccName -> String

showList :: [OccName] -> ShowS

NFData OccName

Defined in GHC.Types.Name.Occurrence

Methods

rnf :: OccName -> ()

HasOccName OccName

Defined in GHC.Types.Name.Occurrence

Methods

occName :: OccName -> OccName

Uniquable OccName

Defined in GHC.Types.Name.Occurrence

Methods

getUnique :: OccName -> Unique

Binary OccName

Defined in GHC.Types.Name.Occurrence

Methods

put_ :: BinHandle -> OccName -> IO ()

put :: BinHandle -> OccName -> IO (Bin OccName)

get :: BinHandle -> IO OccName

Outputable OccName

Defined in GHC.Types.Name.Occurrence

Methods

ppr :: OccName -> SDoc

OutputableBndr OccName

Defined in GHC.Types.Name.Occurrence

Methods

pprBndr :: BindingSite -> OccName -> SDoc

pprPrefixOcc :: OccName -> SDoc

pprInfixOcc :: OccName -> SDoc

bndrIsJoin_maybe :: OccName -> Maybe Int

Eq OccName

Defined in GHC.Types.Name.Occurrence

Methods

(==) :: OccName -> OccName -> Bool

(/=) :: OccName -> OccName -> Bool

Ord OccName

Defined in GHC.Types.Name.Occurrence

Methods

compare :: OccName -> OccName -> Ordering

(<) :: OccName -> OccName -> Bool

(<=) :: OccName -> OccName -> Bool

(>) :: OccName -> OccName -> Bool

(>=) :: OccName -> OccName -> Bool

max :: OccName -> OccName -> OccName

min :: OccName -> OccName -> OccName

Hashable OccName

Defined in Development.IDE.GHC.Orphans

Methods

hashWithSalt :: Int -> OccName -> Int

hash :: OccName -> Int

class HasOccName name where

Other names in the compiler add additional information to an OccName. This class provides a consistent way to access the underlying OccName.

Methods

occName :: name -> OccName

Instances

HasOccName IfaceClassOp

Defined in GHC.Iface.Syntax

Methods

occName :: IfaceClassOp -> OccName

HasOccName IfaceConDecl

Defined in GHC.Iface.Syntax

Methods

occName :: IfaceConDecl -> OccName

HasOccName IfaceDecl

Defined in GHC.Iface.Syntax

Methods

occName :: IfaceDecl -> OccName

HasOccName HoleFitCandidate

Defined in GHC.Tc.Errors.Hole.FitTypes

Methods

occName :: HoleFitCandidate -> OccName

HasOccName TcBinder

Defined in GHC.Tc.Types

Methods

occName :: TcBinder -> OccName

HasOccName GreName

Defined in GHC.Types.Avail

Methods

occName :: GreName -> OccName

HasOccName FieldLabel

Defined in GHC.Types.FieldLabel

Methods

occName :: FieldLabel -> OccName

HasOccName Name

Defined in GHC.Types.Name

Methods

occName :: Name -> OccName

HasOccName OccName

Defined in GHC.Types.Name.Occurrence

Methods

occName :: OccName -> OccName

HasOccName GlobalRdrElt

Defined in GHC.Types.Name.Reader

Methods

occName :: GlobalRdrElt -> OccName

HasOccName RdrName

Defined in GHC.Types.Name.Reader

Methods

occName :: RdrName -> OccName

HasOccName Var

Defined in GHC.Types.Var

Methods

occName :: Var -> OccName

HasOccName name => HasOccName (IEWrappedName name)

Defined in GHC.Hs.ImpExp

Methods

occName :: IEWrappedName name -> OccName

occNameString :: OccName -> String

mkVarOccFS :: FastString -> OccName

mkRecFldSelOcc :: String -> OccName

module GHC.Types.Name.Set

module GHC.Types.Name.Cache

module GHC.Types.Name.Env

data RdrName

Reader Name

Do not use the data constructors of RdrName directly: prefer the family of functions that creates them, such as mkRdrUnqual

• Note: A Located RdrName will only have API Annotations if it is a compound one, e.g.

`bar`
( ~ )

• AnnKeywordId : AnnType, AnnOpen '(' or '[' or '[:', AnnClose ')' or ']' or ':]',, AnnBackquote '`', AnnVal AnnTilde,

Constructors

Unqual OccName

Unqualified name

Used for ordinary, unqualified occurrences, e.g. x, y or Foo. Create such a RdrName with mkRdrUnqual

Qual ModuleName OccName

Qualified name

A qualified name written by the user in source code. The module isn't necessarily the module where the thing is defined; just the one from which it is imported. Examples are Bar.x, Bar.y or Bar.Foo. Create such a RdrName with mkRdrQual

Orig Module OccName

Original name

An original name; the module is the defining module. This is used when GHC generates code that will be fed into the renamer (e.g. from deriving clauses), but where we want to say "Use Prelude.map dammit". One of these can be created with mkOrig

Exact Name

Exact name

We know exactly the Name. This is used:

1. When the parser parses built-in syntax like [] and (,), but wants a RdrName from it
2. By Template Haskell, when TH has generated a unique name

Such a RdrName can be created by using getRdrName on a Name

Instances

Data RdrName

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> RdrName -> c RdrName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c RdrName

toConstr :: RdrName -> Constr

dataTypeOf :: RdrName -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c RdrName)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c RdrName)

gmapT :: (forall b. Data b => b -> b) -> RdrName -> RdrName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> RdrName -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> RdrName -> r

gmapQ :: (forall d. Data d => d -> u) -> RdrName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> RdrName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> RdrName -> m RdrName

DisambInfixOp RdrName

Defined in GHC.Parser.PostProcess

Methods

mkHsVarOpPV :: LocatedN RdrName -> PV (LocatedN RdrName)

mkHsConOpPV :: LocatedN RdrName -> PV (LocatedN RdrName)

mkHsInfixHolePV :: SrcSpan -> (EpAnnComments -> EpAnn EpAnnUnboundVar) -> PV (Located RdrName)

HasOccName RdrName

Defined in GHC.Types.Name.Reader

Methods

occName :: RdrName -> OccName

Outputable RdrName

Defined in GHC.Types.Name.Reader

Methods

ppr :: RdrName -> SDoc

OutputableBndr RdrName

Defined in GHC.Types.Name.Reader

Methods

pprBndr :: BindingSite -> RdrName -> SDoc

pprPrefixOcc :: RdrName -> SDoc

pprInfixOcc :: RdrName -> SDoc

bndrIsJoin_maybe :: RdrName -> Maybe Int

Eq RdrName

Defined in GHC.Types.Name.Reader

Methods

(==) :: RdrName -> RdrName -> Bool

(/=) :: RdrName -> RdrName -> Bool

Ord RdrName

Defined in GHC.Types.Name.Reader

Methods

compare :: RdrName -> RdrName -> Ordering

(<) :: RdrName -> RdrName -> Bool

(<=) :: RdrName -> RdrName -> Bool

(>) :: RdrName -> RdrName -> Bool

(>=) :: RdrName -> RdrName -> Bool

max :: RdrName -> RdrName -> RdrName

min :: RdrName -> RdrName -> RdrName

type Anno RdrName

Defined in GHC.Hs.Extension

type Anno RdrName = SrcSpanAnnN

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

data Parent

See Note [Parents]

Constructors

NoParent

ParentIs

Fields

• par_is :: Name

Instances

Data Parent

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Parent -> c Parent

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Parent

toConstr :: Parent -> Constr

dataTypeOf :: Parent -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Parent)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Parent)

gmapT :: (forall b. Data b => b -> b) -> Parent -> Parent

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Parent -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Parent -> r

gmapQ :: (forall d. Data d => d -> u) -> Parent -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Parent -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Parent -> m Parent

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Parent -> m Parent

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Parent -> m Parent

Outputable Parent

Defined in GHC.Types.Name.Reader

Methods

ppr :: Parent -> SDoc

Eq Parent

Defined in GHC.Types.Name.Reader

Methods

(==) :: Parent -> Parent -> Bool

(/=) :: Parent -> Parent -> Bool

data LocalRdrEnv

Local Reader Environment See Note [LocalRdrEnv]

Instances

Outputable LocalRdrEnv

Defined in GHC.Types.Name.Reader

Methods

ppr :: LocalRdrEnv -> SDoc

data ImportSpec

Import Specification

The ImportSpec of something says how it came to be imported It's quite elaborate so that we can give accurate unused-name warnings.

Constructors

ImpSpec

Fields

• is_decl :: ImpDeclSpec
• is_item :: ImpItemSpec

Instances

Data ImportSpec

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImportSpec -> c ImportSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImportSpec

toConstr :: ImportSpec -> Constr

dataTypeOf :: ImportSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImportSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImportSpec)

gmapT :: (forall b. Data b => b -> b) -> ImportSpec -> ImportSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImportSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> ImportSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImportSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImportSpec -> m ImportSpec

Outputable ImportSpec

Defined in GHC.Types.Name.Reader

Methods

ppr :: ImportSpec -> SDoc

Eq ImportSpec

Defined in GHC.Types.Name.Reader

Methods

(==) :: ImportSpec -> ImportSpec -> Bool

(/=) :: ImportSpec -> ImportSpec -> Bool

data ImpItemSpec

Import Item Specification

Describes import info a particular Name

Constructors

ImpAll

The import had no import list, or had a hiding list

ImpSome

The import had an import list. The is_explicit field is True iff the thing was named explicitly in the import specs rather than being imported as part of a "..." group. Consider:

import C( T(..) )

Here the constructors of T are not named explicitly; only T is named explicitly.

Fields

• is_explicit :: Bool
• is_iloc :: SrcSpan

Instances

Data ImpItemSpec

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImpItemSpec -> c ImpItemSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImpItemSpec

toConstr :: ImpItemSpec -> Constr

dataTypeOf :: ImpItemSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImpItemSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImpItemSpec)

gmapT :: (forall b. Data b => b -> b) -> ImpItemSpec -> ImpItemSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImpItemSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImpItemSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> ImpItemSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImpItemSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpItemSpec -> m ImpItemSpec

Eq ImpItemSpec

Defined in GHC.Types.Name.Reader

Methods

(==) :: ImpItemSpec -> ImpItemSpec -> Bool

(/=) :: ImpItemSpec -> ImpItemSpec -> Bool

data ImpDeclSpec

Import Declaration Specification

Describes a particular import declaration and is shared among all the Provenances for that decl

Constructors

ImpDeclSpec

Fields

• is_mod :: ModuleName

  Module imported, e.g. import Muggle Note the Muggle may well not be the defining module for this thing!

• is_as :: ModuleName

  Import alias, e.g. from as M (or Muggle if there is no as clause)

• is_qual :: Bool

  Was this import qualified?

• is_dloc :: SrcSpan

  The location of the entire import declaration

Instances

Data ImpDeclSpec

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ImpDeclSpec -> c ImpDeclSpec

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ImpDeclSpec

toConstr :: ImpDeclSpec -> Constr

dataTypeOf :: ImpDeclSpec -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ImpDeclSpec)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ImpDeclSpec)

gmapT :: (forall b. Data b => b -> b) -> ImpDeclSpec -> ImpDeclSpec

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ImpDeclSpec -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ImpDeclSpec -> r

gmapQ :: (forall d. Data d => d -> u) -> ImpDeclSpec -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ImpDeclSpec -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ImpDeclSpec -> m ImpDeclSpec

Eq ImpDeclSpec

Defined in GHC.Types.Name.Reader

Methods

(==) :: ImpDeclSpec -> ImpDeclSpec -> Bool

(/=) :: ImpDeclSpec -> ImpDeclSpec -> Bool

type GlobalRdrEnv = OccEnv [GlobalRdrElt]

Global Reader Environment

Keyed by OccName; when looking up a qualified name we look up the OccName part, and then check the Provenance to see if the appropriate qualification is valid. This saves routinely doubling the size of the env by adding both qualified and unqualified names to the domain.

The list in the codomain is required because there may be name clashes These only get reported on lookup, not on construction

INVARIANT 1: All the members of the list have distinct gre_name fields; that is, no duplicate Names

INVARIANT 2: Imported provenance => Name is an ExternalName However LocalDefs can have an InternalName. This happens only when type-checking a [d| ... |] Template Haskell quotation; see this note in GHC.Rename.Names Note [Top-level Names in Template Haskell decl quotes]

INVARIANT 3: If the GlobalRdrEnv maps [occ -> gre], then greOccName gre = occ

NB: greOccName gre is usually the same as nameOccName (greMangledName gre), but not always in the case of record selectors; see Note [GreNames]

data GlobalRdrElt

Global Reader Element

An element of the GlobalRdrEnv

Instances

Data GlobalRdrElt

Defined in GHC.Types.Name.Reader

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GlobalRdrElt -> c GlobalRdrElt

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c GlobalRdrElt

toConstr :: GlobalRdrElt -> Constr

dataTypeOf :: GlobalRdrElt -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c GlobalRdrElt)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c GlobalRdrElt)

gmapT :: (forall b. Data b => b -> b) -> GlobalRdrElt -> GlobalRdrElt

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GlobalRdrElt -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GlobalRdrElt -> r

gmapQ :: (forall d. Data d => d -> u) -> GlobalRdrElt -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GlobalRdrElt -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GlobalRdrElt -> m GlobalRdrElt

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GlobalRdrElt -> m GlobalRdrElt

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GlobalRdrElt -> m GlobalRdrElt

HasOccName GlobalRdrElt

Defined in GHC.Types.Name.Reader

Methods

occName :: GlobalRdrElt -> OccName

Outputable GlobalRdrElt

Defined in GHC.Types.Name.Reader

Methods

ppr :: GlobalRdrElt -> SDoc

Eq GlobalRdrElt

Defined in GHC.Types.Name.Reader

Methods

(==) :: GlobalRdrElt -> GlobalRdrElt -> Bool

(/=) :: GlobalRdrElt -> GlobalRdrElt -> Bool

unQualSpecOK :: ImportSpec -> Bool

Is in scope unqualified?

unQualOK :: GlobalRdrElt -> Bool

Test if an unqualified version of this thing would be in scope

transformGREs :: (GlobalRdrElt -> GlobalRdrElt) -> [OccName] -> GlobalRdrEnv -> GlobalRdrEnv

Apply a transformation function to the GREs for these OccNames

starInfo :: Bool -> RdrName -> SDoc

Display info about the treatment of * under NoStarIsType.

With StarIsType, three properties of * hold:

(a) it is not an infix operator (b) it is always in scope (c) it is a synonym for Data.Kind.Type

However, the user might not know that they are working on a module with NoStarIsType and write code that still assumes (a), (b), and (c), which actually do not hold in that module.

Violation of (a) shows up in the parser. For instance, in the following examples, we have * not applied to enough arguments:

data A :: * data F :: * -> *

Violation of (b) or (c) show up in the renamer and the typechecker respectively. For instance:

type K = Either * Bool

This will parse differently depending on whether StarIsType is enabled, but it will parse nonetheless. With NoStarIsType it is parsed as a type operator, thus we have ((*) Either Bool). Now there are two cases to consider:

1. There is no definition of (*) in scope. In this case the renamer will fail to look it up. This is a violation of assumption (b).
2. There is a definition of the (*) type operator in scope (for example coming from GHC.TypeNats). In this case the user will get a kind mismatch error. This is a violation of assumption (c).

The user might unknowingly be working on a module with NoStarIsType or use * as Type out of habit. So it is important to give a hint whenever an assumption about * is violated. Unfortunately, it is somewhat difficult to deal with (c), so we limit ourselves to (a) and (b).

starInfo generates an appropriate hint to the user depending on the extensions enabled in the module and the name that triggered the error. That is, if we have NoStarIsType and the error is related to * or its Unicode variant, the resulting SDoc will contain a helpful suggestion. Otherwise it is empty.

shadowNames :: GlobalRdrEnv -> [GreName] -> GlobalRdrEnv

rdrNameSpace :: RdrName -> NameSpace

rdrNameOcc :: RdrName -> OccName

qualSpecOK :: ModuleName -> ImportSpec -> Bool

Is in scope qualified with the given module?

promoteRdrName :: RdrName -> Maybe RdrName

pprNameProvenance :: GlobalRdrElt -> SDoc

Print out one place where the name was define/imported (With -dppr-debug, print them all)

pprGlobalRdrEnv :: Bool -> GlobalRdrEnv -> SDoc

plusGlobalRdrEnv :: GlobalRdrEnv -> GlobalRdrEnv -> GlobalRdrEnv

pickGREsModExp :: ModuleName -> [GlobalRdrElt] -> [(GlobalRdrElt, GlobalRdrElt)]

Pick GREs that are in scope *both* qualified *and* unqualified Return each GRE that is, as a pair (qual_gre, unqual_gre) These two GREs are the original GRE with imports filtered to express how it is in scope qualified an unqualified respectively

Used only for the 'module M' item in export list; see exports_from_avail

pickGREs :: RdrName -> [GlobalRdrElt] -> [GlobalRdrElt]

Takes a list of GREs which have the right OccName x Pick those GREs that are in scope * Qualified, as x if want_qual is Qual M _ * Unqualified, as x if want_unqual is Unqual _

Return each such GRE, with its ImportSpecs filtered, to reflect how it is in scope qualified or unqualified respectively. See Note [GRE filtering]

opIsAt :: RdrName -> Bool

Indicate if the given name is the "@" operator

nameRdrName :: Name -> RdrName

mkVarUnqual :: FastString -> RdrName

mkUnqual :: NameSpace -> FastString -> RdrName

mkRdrUnqual :: OccName -> RdrName

mkRdrQual :: ModuleName -> OccName -> RdrName

mkQual :: NameSpace -> (FastString, FastString) -> RdrName

Make a qualified RdrName in the given namespace and where the ModuleName and the OccName are taken from the first and second elements of the tuple respectively

mkOrig :: Module -> OccName -> RdrName

mkGlobalRdrEnv :: [GlobalRdrElt] -> GlobalRdrEnv

lookupLocalRdrOcc :: LocalRdrEnv -> OccName -> Maybe Name

lookupLocalRdrEnv :: LocalRdrEnv -> RdrName -> Maybe Name

lookupGlobalRdrEnv :: GlobalRdrEnv -> OccName -> [GlobalRdrElt]

lookupGRE_RdrName' :: RdrName -> GlobalRdrEnv -> [GlobalRdrElt]

Look for this RdrName in the global environment. Includes record fields without selector functions (see Note [NoFieldSelectors] in GHC.Rename.Env).

lookupGRE_RdrName :: RdrName -> GlobalRdrEnv -> [GlobalRdrElt]

Look for this RdrName in the global environment. Omits record fields without selector functions (see Note [NoFieldSelectors] in GHC.Rename.Env).

lookupGRE_Name_OccName :: GlobalRdrEnv -> Name -> OccName -> Maybe GlobalRdrElt

Look for precisely this Name in the environment, but with an OccName that might differ from that of the Name. See lookupGRE_FieldLabel and Note [GreNames].

lookupGRE_Name :: GlobalRdrEnv -> Name -> Maybe GlobalRdrElt

Look for precisely this Name in the environment. This tests whether it is in scope, ignoring anything else that might be in scope with the same OccName.

lookupGRE_GreName :: GlobalRdrEnv -> GreName -> Maybe GlobalRdrElt

Look for precisely this GreName in the environment. This tests whether it is in scope, ignoring anything else that might be in scope with the same OccName.

lookupGRE_FieldLabel :: GlobalRdrEnv -> FieldLabel -> Maybe GlobalRdrElt

Look for a particular record field selector in the environment, where the selector name and field label may be different: the GlobalRdrEnv is keyed on the label. See Note [GreNames] for why this happens.

localRdrEnvElts :: LocalRdrEnv -> [Name]

localGREsFromAvail :: AvailInfo -> [GlobalRdrElt]

isUnqual :: RdrName -> Bool

isSrcRdrName :: RdrName -> Bool

isRecFldGRE :: GlobalRdrElt -> Bool

isRdrTyVar :: RdrName -> Bool

isRdrTc :: RdrName -> Bool

isRdrDataCon :: RdrName -> Bool

isQual_maybe :: RdrName -> Maybe (ModuleName, OccName)

isQual :: RdrName -> Bool

isOrig_maybe :: RdrName -> Maybe (Module, OccName)

isOrig :: RdrName -> Bool

isNoFieldSelectorGRE :: GlobalRdrElt -> Bool

Is this a record field defined with NoFieldSelectors? (See Note [NoFieldSelectors] in GHC.Rename.Env)

isLocalGRE :: GlobalRdrElt -> Bool

isFieldSelectorGRE :: GlobalRdrElt -> Bool

Is this a record field defined with FieldSelectors? (See Note [NoFieldSelectors] in GHC.Rename.Env)

isExplicitItem :: ImpItemSpec -> Bool

isExact_maybe :: RdrName -> Maybe Name

isExact :: RdrName -> Bool

isDuplicateRecFldGRE :: GlobalRdrElt -> Bool

Is this a record field defined with DuplicateRecordFields? (See Note [GreNames])

inLocalRdrEnvScope :: Name -> LocalRdrEnv -> Bool

importSpecModule :: ImportSpec -> ModuleName

importSpecLoc :: ImportSpec -> SrcSpan

gresToAvailInfo :: [GlobalRdrElt] -> [AvailInfo]

Takes a list of distinct GREs and folds them into AvailInfos. This is more efficient than mapping each individual GRE to an AvailInfo and the folding using plusAvail but needs the uniqueness assumption.

gresFromAvails :: Maybe ImportSpec -> [AvailInfo] -> [GlobalRdrElt]

make a GlobalRdrEnv where all the elements point to the same Provenance (useful for "hiding" imports, or imports with no details).

gresFromAvail :: (Name -> Maybe ImportSpec) -> AvailInfo -> [GlobalRdrElt]

greSrcSpan :: GlobalRdrElt -> SrcSpan

greRdrNames :: GlobalRdrElt -> [RdrName]

greQualModName :: GlobalRdrElt -> ModuleName

grePrintableName :: GlobalRdrElt -> Name

A Name for the GRE suitable for output to the user. Its OccName will be the greOccName (see Note [GreNames]).

greParent_maybe :: GlobalRdrElt -> Maybe Name

greOccName :: GlobalRdrElt -> OccName

See Note [GreNames]

greMangledName :: GlobalRdrElt -> Name

A Name for the GRE for internal use. Careful: the OccName of this Name is not necessarily the same as the greOccName (see Note [GreNames]).

greFieldLabel :: GlobalRdrElt -> Maybe FieldLabel

Returns the field label of this GRE, if it has one

greDefinitionSrcSpan :: GlobalRdrElt -> SrcSpan

The SrcSpan of the name pointed to by the GRE.

greDefinitionModule :: GlobalRdrElt -> Maybe Module

The module in which the name pointed to by the GRE is defined.

globalRdrEnvElts :: GlobalRdrEnv -> [GlobalRdrElt]

getRdrName :: NamedThing thing => thing -> RdrName

getGRE_NameQualifier_maybes :: GlobalRdrEnv -> Name -> [Maybe [ModuleName]]

extendLocalRdrEnvList :: LocalRdrEnv -> [Name] -> LocalRdrEnv

extendLocalRdrEnv :: LocalRdrEnv -> Name -> LocalRdrEnv

extendGlobalRdrEnv :: GlobalRdrEnv -> GlobalRdrElt -> GlobalRdrEnv

emptyLocalRdrEnv :: LocalRdrEnv

emptyGlobalRdrEnv :: GlobalRdrEnv

elemLocalRdrEnv :: RdrName -> LocalRdrEnv -> Bool

demoteRdrName :: RdrName -> Maybe RdrName

delLocalRdrEnvList :: LocalRdrEnv -> [OccName] -> LocalRdrEnv

bestImport :: [ImportSpec] -> ImportSpec

availFromGRE :: GlobalRdrElt -> AvailInfo

data GreName

Used where we may have an ordinary name or a record field label. See Note [GreNames] in GHC.Types.Name.Reader.

Constructors

NormalGreName Name

FieldGreName FieldLabel

Instances

Data GreName

Defined in GHC.Types.Avail

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GreName -> c GreName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c GreName

toConstr :: GreName -> Constr

dataTypeOf :: GreName -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c GreName)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c GreName)

gmapT :: (forall b. Data b => b -> b) -> GreName -> GreName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GreName -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GreName -> r

gmapQ :: (forall d. Data d => d -> u) -> GreName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GreName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GreName -> m GreName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GreName -> m GreName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GreName -> m GreName

HasOccName GreName

Defined in GHC.Types.Avail

Methods

occName :: GreName -> OccName

Binary GreName

Defined in GHC.Types.Avail

Methods

put_ :: BinHandle -> GreName -> IO ()

put :: BinHandle -> GreName -> IO (Bin GreName)

get :: BinHandle -> IO GreName

Outputable GreName

Defined in GHC.Types.Avail

Methods

ppr :: GreName -> SDoc

Eq GreName

Defined in GHC.Types.Avail

Methods

(==) :: GreName -> GreName -> Bool

(/=) :: GreName -> GreName -> Bool

greNameSrcSpan :: GreName -> SrcSpan

data Severity

Constructors

SevOutput

SevFatal

SevInteractive

SevDump

Log message intended for compiler developers No file/line/column stuff

SevInfo

Log messages intended for end users. No file/line/column stuff.

SevWarning

SevError

SevWarning and SevError are used for warnings and errors o The message has a file/line/column heading, plus "warning:" or "error:", added by mkLocMessags o Output is intended for end users

Instances

Show Severity

Defined in GHC.Types.Error

Methods

showsPrec :: Int -> Severity -> ShowS

show :: Severity -> String

showList :: [Severity] -> ShowS

ToJson Severity

Defined in GHC.Types.Error

Methods

json :: Severity -> JsonDoc

Eq Severity

Defined in GHC.Types.Error

Methods

(==) :: Severity -> Severity -> Bool

(/=) :: Severity -> Severity -> Bool

emptyMessages :: Messages e

greNamePrintableName :: GreName -> Name

A Name suitable for output to the user. For fields, the OccName will be the field label. See Note [GreNames] in GHC.Types.Name.Reader.

data SourceModified

Indicates whether a given module's source has been modified since it was last compiled.

Constructors

SourceModified

the source has been modified

SourceUnmodified

the source has not been modified. Compilation may or may not be necessary, depending on whether any dependencies have changed since we last compiled.

SourceUnmodifiedAndStable

the source has not been modified, and furthermore all of its (transitive) dependencies are up to date; it definitely does not need to be recompiled. This is important for two reasons: (a) we can omit the version check in checkOldIface, and (b) if the module used TH splices we don't need to force recompilation.

Instances

Show SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> SourceModified -> ShowS

show :: SourceModified -> String

showList :: [SourceModified] -> ShowS

NFData SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: SourceModified -> ()

Eq SourceModified

Defined in Development.IDE.GHC.Orphans

Methods

(==) :: SourceModified -> SourceModified -> Bool

(/=) :: SourceModified -> SourceModified -> Bool

data HscSource

Constructors

HsSrcFile

.hs file

HsBootFile

.hs-boot file

HsigFile

.hsig file

Instances

Show HscSource

Defined in GHC.Types.SourceFile

Methods

showsPrec :: Int -> HscSource -> ShowS

show :: HscSource -> String

showList :: [HscSource] -> ShowS

Binary HscSource

Defined in GHC.Types.SourceFile

Methods

put_ :: BinHandle -> HscSource -> IO ()

put :: BinHandle -> HscSource -> IO (Bin HscSource)

get :: BinHandle -> IO HscSource

Eq HscSource

Defined in GHC.Types.SourceFile

Methods

(==) :: HscSource -> HscSource -> Bool

(/=) :: HscSource -> HscSource -> Bool

Ord HscSource

Defined in GHC.Types.SourceFile

Methods

compare :: HscSource -> HscSource -> Ordering

(<) :: HscSource -> HscSource -> Bool

(<=) :: HscSource -> HscSource -> Bool

(>) :: HscSource -> HscSource -> Bool

(>=) :: HscSource -> HscSource -> Bool

max :: HscSource -> HscSource -> HscSource

min :: HscSource -> HscSource -> HscSource

module GHC.Types.SourceText

module GHC.Types.TyThing

module GHC.Types.TyThing.Ppr

module GHC.Types.Unique.Supply

setVarUnique :: Var -> Unique -> Var

setTyVarUnique :: TyVar -> Unique -> TyVar

data Var

Variable

Essentially a typed Name, that may also contain some additional information about the Var and its use sites.

Instances

Data Var

Defined in GHC.Types.Var

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Var -> c Var

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Var

toConstr :: Var -> Constr

dataTypeOf :: Var -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Var)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Var)

gmapT :: (forall b. Data b => b -> b) -> Var -> Var

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Var -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Var -> r

gmapQ :: (forall d. Data d => d -> u) -> Var -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Var -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Var -> m Var

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Var -> m Var

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Var -> m Var

NamedThing Var

Defined in GHC.Types.Var

Methods

getOccName :: Var -> OccName

getName :: Var -> Name

HasOccName Var

Defined in GHC.Types.Var

Methods

occName :: Var -> OccName

Uniquable Var

Defined in GHC.Types.Var

Methods

getUnique :: Var -> Unique

Outputable Var

Defined in GHC.Types.Var

Methods

ppr :: Var -> SDoc

Eq Var

Defined in GHC.Types.Var

Methods

(==) :: Var -> Var -> Bool

(/=) :: Var -> Var -> Bool

Ord Var

Defined in GHC.Types.Var

Methods

compare :: Var -> Var -> Ordering

(<) :: Var -> Var -> Bool

(<=) :: Var -> Var -> Bool

(>) :: Var -> Var -> Bool

(>=) :: Var -> Var -> Bool

max :: Var -> Var -> Var

min :: Var -> Var -> Var

ModifyState Id

Defined in Compat.HieAst

Methods

addSubstitution :: Id -> Id -> HieState -> HieState

ToHie (Context (Located Var))

Defined in Compat.HieAst

Methods

toHie :: Context (Located Var) -> HieM [HieAST Type]

type Anno Id

Defined in GHC.Hs.Extension

type Anno Id = SrcSpanAnnN

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

class HasModule (m :: Type -> Type) where

Methods

getModule :: m Module

Instances

ContainsModule env => HasModule (IOEnv env)

Defined in GHC.Data.IOEnv

Methods

getModule :: IOEnv env Module

class ContainsModule t where

Methods

extractModule :: t -> Module

Instances

ContainsModule DsGblEnv

Defined in GHC.HsToCore.Types

Methods

extractModule :: DsGblEnv -> Module

ContainsModule TcGblEnv

Defined in GHC.Tc.Types

Methods

extractModule :: TcGblEnv -> Module

ContainsModule gbl => ContainsModule (Env gbl lcl)

Defined in GHC.Tc.Types

Methods

extractModule :: Env gbl lcl -> Module

uninstantiateInstantiatedUnit :: InstantiatedUnit -> InstantiatedUnit

Remove instantiations of the given instantiated unit

uninstantiateInstantiatedModule :: InstantiatedModule -> InstantiatedModule

Remove instantiations of the given module instantiated unit

stableModuleCmp :: Module -> Module -> Ordering

This gives a stable ordering, as opposed to the Ord instance which gives an ordering based on the Uniques of the components, which may not be stable from run to run of the compiler.

moduleStableString :: Module -> String

Get a string representation of a Module that's unique and stable across recompilations. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal"

moduleIsDefinite :: Module -> Bool

A Module is definite if it has no free holes.

mkHoleModule :: ModuleName -> GenModule (GenUnit u)

Create a hole Module

isHoleModule :: GenModule (GenUnit u) -> Bool

Test if a Module is not instantiated

installedModuleEq :: InstalledModule -> Module -> Bool

Test if a Module corresponds to a given InstalledModule, modulo instantiation.

getUnitInstantiations :: Unit -> (UnitId, Maybe InstantiatedUnit)

Return the unit-id this unit is an instance of and the module instantiations (if any).

getModuleInstantiation :: Module -> (InstalledModule, Maybe InstantiatedModule)

Given a possibly on-the-fly instantiated module, split it into a Module that we definitely can find on-disk, as well as an instantiation if we need to instantiate it on the fly. If the instantiation is Nothing no on-the-fly renaming is needed.

type ModuleSet = Set NDModule

A set of Modules

type ModuleNameEnv elt = UniqFM ModuleName elt

A map keyed off of ModuleNames (actually, their Uniques)

data ModuleEnv elt

A map keyed off of Modules

data InstalledModuleEnv elt

A map keyed off of InstalledModule

type DModuleNameEnv elt = UniqDFM ModuleName elt

A map keyed off of ModuleNames (actually, their Uniques) Has deterministic folds and can be deterministically converted to a list

unitModuleSet :: Module -> ModuleSet

unitModuleEnv :: Module -> a -> ModuleEnv a

unionModuleSet :: ModuleSet -> ModuleSet -> ModuleSet

plusModuleEnv_C :: (a -> a -> a) -> ModuleEnv a -> ModuleEnv a -> ModuleEnv a

plusModuleEnv :: ModuleEnv a -> ModuleEnv a -> ModuleEnv a

moduleSetElts :: ModuleSet -> [Module]

moduleEnvToList :: ModuleEnv a -> [(Module, a)]

moduleEnvKeys :: ModuleEnv a -> [Module]

moduleEnvElts :: ModuleEnv a -> [a]

mkModuleSet :: [Module] -> ModuleSet

mkModuleEnv :: [(Module, a)] -> ModuleEnv a

minusModuleSet :: ModuleSet -> ModuleSet -> ModuleSet

mapModuleEnv :: (a -> b) -> ModuleEnv a -> ModuleEnv b

lookupWithDefaultModuleEnv :: ModuleEnv a -> a -> Module -> a

lookupModuleEnv :: ModuleEnv a -> Module -> Maybe a

lookupInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> Maybe a

isEmptyModuleEnv :: ModuleEnv a -> Bool

intersectModuleSet :: ModuleSet -> ModuleSet -> ModuleSet

filterModuleEnv :: (Module -> a -> Bool) -> ModuleEnv a -> ModuleEnv a

filterInstalledModuleEnv :: (InstalledModule -> a -> Bool) -> InstalledModuleEnv a -> InstalledModuleEnv a

extendModuleSetList :: ModuleSet -> [Module] -> ModuleSet

extendModuleSet :: ModuleSet -> Module -> ModuleSet

extendModuleEnvWith :: (a -> a -> a) -> ModuleEnv a -> Module -> a -> ModuleEnv a

extendModuleEnvList_C :: (a -> a -> a) -> ModuleEnv a -> [(Module, a)] -> ModuleEnv a

extendModuleEnvList :: ModuleEnv a -> [(Module, a)] -> ModuleEnv a

extendModuleEnv :: ModuleEnv a -> Module -> a -> ModuleEnv a

extendInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> a -> InstalledModuleEnv a

emptyModuleSet :: ModuleSet

emptyModuleEnv :: ModuleEnv a

emptyInstalledModuleEnv :: InstalledModuleEnv a

elemModuleSet :: Module -> ModuleSet -> Bool

elemModuleEnv :: Module -> ModuleEnv a -> Bool

delModuleSet :: ModuleSet -> Module -> ModuleSet

delModuleEnvList :: ModuleEnv a -> [Module] -> ModuleEnv a

delModuleEnv :: ModuleEnv a -> Module -> ModuleEnv a

delInstalledModuleEnv :: InstalledModuleEnv a -> InstalledModule -> InstalledModuleEnv a

removeBootSuffix :: FilePath -> FilePath

Remove the -boot suffix to .hs, .hi and .o files

addBootSuffix_maybe :: IsBootInterface -> FilePath -> FilePath

Add the -boot suffix if the Bool argument is True

addBootSuffixLocn :: ModLocation -> ModLocation

Add the -boot suffix to all file paths associated with the module

addBootSuffix :: FilePath -> FilePath

Add the -boot suffix to .hs, .hi and .o files

newtype UnitKey

A unit key in the database

Constructors

UnitKey FastString

Instances

IsUnitId UnitKey

Defined in GHC.Unit.Types

Methods

unitFS :: UnitKey -> FastString

type ModuleWithIsBoot = GenWithIsBoot Module

type ModuleNameWithIsBoot = GenWithIsBoot ModuleName

class IsUnitId u where

Class for types that are used as unit identifiers (UnitKey, UnitId, Unit)

We need this class because we create new unit ids for virtual units (see VirtUnit) and they have to to be made from units with different kinds of identifiers.

Methods

unitFS :: u -> FastString

Instances

IsUnitId UnitId

Defined in GHC.Unit.Types

Methods

unitFS :: UnitId -> FastString

IsUnitId UnitKey

Defined in GHC.Unit.Types

Methods

unitFS :: UnitKey -> FastString

IsUnitId unit => IsUnitId (Definite unit)

Defined in GHC.Unit.Types

Methods

unitFS :: Definite unit -> FastString

IsUnitId u => IsUnitId (GenUnit u)

Defined in GHC.Unit.Types

Methods

unitFS :: GenUnit u -> FastString

IsUnitId unit => IsUnitId (Indefinite unit)

Defined in GHC.Unit.Types

Methods

unitFS :: Indefinite unit -> FastString

data IsBootInterface

Indicates whether a module name is referring to a boot interface (hs-boot file) or regular module (hs file). We need to treat boot modules specially when building compilation graphs, since they break cycles. Regular source files and signature files are treated equivalently.

Constructors

NotBoot

IsBoot

Instances

Data IsBootInterface

Defined in GHC.Unit.Types

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> IsBootInterface -> c IsBootInterface

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c IsBootInterface

toConstr :: IsBootInterface -> Constr

dataTypeOf :: IsBootInterface -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c IsBootInterface)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c IsBootInterface)

gmapT :: (forall b. Data b => b -> b) -> IsBootInterface -> IsBootInterface

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> IsBootInterface -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> IsBootInterface -> r

gmapQ :: (forall d. Data d => d -> u) -> IsBootInterface -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> IsBootInterface -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> IsBootInterface -> m IsBootInterface

Show IsBootInterface

Defined in GHC.Unit.Types

Methods

showsPrec :: Int -> IsBootInterface -> ShowS

show :: IsBootInterface -> String

showList :: [IsBootInterface] -> ShowS

Binary IsBootInterface

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> IsBootInterface -> IO ()

put :: BinHandle -> IsBootInterface -> IO (Bin IsBootInterface)

get :: BinHandle -> IO IsBootInterface

Eq IsBootInterface

Defined in GHC.Unit.Types

Methods

(==) :: IsBootInterface -> IsBootInterface -> Bool

(/=) :: IsBootInterface -> IsBootInterface -> Bool

Ord IsBootInterface

Defined in GHC.Unit.Types

Methods

compare :: IsBootInterface -> IsBootInterface -> Ordering

(<) :: IsBootInterface -> IsBootInterface -> Bool

(<=) :: IsBootInterface -> IsBootInterface -> Bool

(>) :: IsBootInterface -> IsBootInterface -> Bool

(>=) :: IsBootInterface -> IsBootInterface -> Bool

max :: IsBootInterface -> IsBootInterface -> IsBootInterface

min :: IsBootInterface -> IsBootInterface -> IsBootInterface

type Instantiations = GenInstantiations UnitId

type InstantiatedUnit = GenInstantiatedUnit UnitId

type InstantiatedModule = GenModule InstantiatedUnit

An InstantiatedModule is a Module whose unit is identified with an InstantiatedUnit.

type InstalledModule = GenModule UnitId

A InstalledModule is a Module whose unit is identified with an UnitId.

data GenWithIsBoot mod

This data type just pairs a value mod with an IsBootInterface flag. In practice, mod is usually a Module or ModuleName'.

Constructors

GWIB

Fields

• gwib_mod :: mod
• gwib_isBoot :: IsBootInterface

Instances

Foldable GenWithIsBoot

Defined in GHC.Unit.Types

Methods

fold :: Monoid m => GenWithIsBoot m -> m

foldMap :: Monoid m => (a -> m) -> GenWithIsBoot a -> m

foldMap' :: Monoid m => (a -> m) -> GenWithIsBoot a -> m

foldr :: (a -> b -> b) -> b -> GenWithIsBoot a -> b

foldr' :: (a -> b -> b) -> b -> GenWithIsBoot a -> b

foldl :: (b -> a -> b) -> b -> GenWithIsBoot a -> b

foldl' :: (b -> a -> b) -> b -> GenWithIsBoot a -> b

foldr1 :: (a -> a -> a) -> GenWithIsBoot a -> a

foldl1 :: (a -> a -> a) -> GenWithIsBoot a -> a

toList :: GenWithIsBoot a -> [a]

null :: GenWithIsBoot a -> Bool

length :: GenWithIsBoot a -> Int

elem :: Eq a => a -> GenWithIsBoot a -> Bool

maximum :: Ord a => GenWithIsBoot a -> a

minimum :: Ord a => GenWithIsBoot a -> a

sum :: Num a => GenWithIsBoot a -> a

product :: Num a => GenWithIsBoot a -> a

Traversable GenWithIsBoot

Defined in GHC.Unit.Types

Methods

traverse :: Applicative f => (a -> f b) -> GenWithIsBoot a -> f (GenWithIsBoot b)

sequenceA :: Applicative f => GenWithIsBoot (f a) -> f (GenWithIsBoot a)

mapM :: Monad m => (a -> m b) -> GenWithIsBoot a -> m (GenWithIsBoot b)

sequence :: Monad m => GenWithIsBoot (m a) -> m (GenWithIsBoot a)

Functor GenWithIsBoot

Defined in GHC.Unit.Types

Methods

fmap :: (a -> b) -> GenWithIsBoot a -> GenWithIsBoot b

(<$) :: a -> GenWithIsBoot b -> GenWithIsBoot a

Show mod => Show (GenWithIsBoot mod)

Defined in GHC.Unit.Types

Methods

showsPrec :: Int -> GenWithIsBoot mod -> ShowS

show :: GenWithIsBoot mod -> String

showList :: [GenWithIsBoot mod] -> ShowS

Binary a => Binary (GenWithIsBoot a)

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> GenWithIsBoot a -> IO ()

put :: BinHandle -> GenWithIsBoot a -> IO (Bin (GenWithIsBoot a))

get :: BinHandle -> IO (GenWithIsBoot a)

Outputable a => Outputable (GenWithIsBoot a)

Defined in GHC.Unit.Types

Methods

ppr :: GenWithIsBoot a -> SDoc

Eq mod => Eq (GenWithIsBoot mod)

Defined in GHC.Unit.Types

Methods

(==) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

(/=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

Ord mod => Ord (GenWithIsBoot mod)

Defined in GHC.Unit.Types

Methods

compare :: GenWithIsBoot mod -> GenWithIsBoot mod -> Ordering

(<) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

(<=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

(>) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

(>=) :: GenWithIsBoot mod -> GenWithIsBoot mod -> Bool

max :: GenWithIsBoot mod -> GenWithIsBoot mod -> GenWithIsBoot mod

min :: GenWithIsBoot mod -> GenWithIsBoot mod -> GenWithIsBoot mod

type GenInstantiations unit = [(ModuleName, GenModule (GenUnit unit))]

data GenInstantiatedUnit unit

An instantiated unit.

It identifies an indefinite library (with holes) that has been instantiated.

This unit may be indefinite or not (i.e. with remaining holes or not). If it is definite, we don't know if it has already been compiled and installed in a database. Nevertheless, we have a mechanism called "improvement" to try to match a fully instantiated unit with existing compiled and installed units: see Note [VirtUnit to RealUnit improvement].

An indefinite unit identifier pretty-prints to something like p[H=H,A=aimpl:A>] (p is the IndefUnitId, and the brackets enclose the module substitution).

Constructors

InstantiatedUnit

Fields

• instUnitFS :: !FastString

  A private, uniquely identifying representation of an InstantiatedUnit. This string is completely private to GHC and is just used to get a unique.

• instUnitKey :: !Unique

  Cached unique of unitFS.

• instUnitInstanceOf :: !(Indefinite unit)

  The indefinite unit being instantiated.

• instUnitInsts :: !(GenInstantiations unit)

  The sorted (by ModuleName) instantiations of this unit.

• instUnitHoles :: UniqDSet ModuleName

  A cache of the free module holes of instUnitInsts. This lets us efficiently tell if a InstantiatedUnit has been fully instantiated (empty set of free module holes) and whether or not a substitution can have any effect.

Instances

Binary InstantiatedUnit

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> InstantiatedUnit -> IO ()

put :: BinHandle -> InstantiatedUnit -> IO (Bin InstantiatedUnit)

get :: BinHandle -> IO InstantiatedUnit

Outputable InstantiatedModule

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedModule -> SDoc

Outputable InstantiatedUnit

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedUnit -> SDoc

Eq (GenInstantiatedUnit unit)

Defined in GHC.Unit.Types

Methods

(==) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool

(/=) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool

Ord (GenInstantiatedUnit unit)

Defined in GHC.Unit.Types

Methods

compare :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Ordering

(<) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool

(<=) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool

(>) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool

(>=) :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> Bool

max :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> GenInstantiatedUnit unit

min :: GenInstantiatedUnit unit -> GenInstantiatedUnit unit -> GenInstantiatedUnit unit

newtype Definite unit

A definite unit (i.e. without any free module hole)

Constructors

Definite

Fields

• unDefinite :: unit

Instances

Functor Definite

Defined in GHC.Unit.Types

Methods

fmap :: (a -> b) -> Definite a -> Definite b

(<$) :: a -> Definite b -> Definite a

Uniquable unit => Uniquable (Definite unit)

Defined in GHC.Unit.Types

Methods

getUnique :: Definite unit -> Unique

IsUnitId unit => IsUnitId (Definite unit)

Defined in GHC.Unit.Types

Methods

unitFS :: Definite unit -> FastString

Binary unit => Binary (Definite unit)

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> Definite unit -> IO ()

put :: BinHandle -> Definite unit -> IO (Bin (Definite unit))

get :: BinHandle -> IO (Definite unit)

Outputable unit => Outputable (Definite unit)

Defined in GHC.Unit.Types

Methods

ppr :: Definite unit -> SDoc

Eq unit => Eq (Definite unit)

Defined in GHC.Unit.Types

Methods

(==) :: Definite unit -> Definite unit -> Bool

(/=) :: Definite unit -> Definite unit -> Bool

Ord unit => Ord (Definite unit)

Defined in GHC.Unit.Types

Methods

compare :: Definite unit -> Definite unit -> Ordering

(<) :: Definite unit -> Definite unit -> Bool

(<=) :: Definite unit -> Definite unit -> Bool

(>) :: Definite unit -> Definite unit -> Bool

(>=) :: Definite unit -> Definite unit -> Bool

max :: Definite unit -> Definite unit -> Definite unit

min :: Definite unit -> Definite unit -> Definite unit

type DefUnitId = Definite UnitId

A DefUnitId is an UnitId with the invariant that it only refers to a definite library; i.e., one we have generated code for.

wiredInUnitIds :: [UnitId]

virtualUnitId :: InstantiatedUnit -> UnitId

Return the virtual UnitId of an on-the-fly instantiated unit.

unitString :: IsUnitId u => u -> String

unitIsDefinite :: Unit -> Bool

A Unit is definite if it has no free holes.

unitIdString :: UnitId -> String

unitFreeModuleHoles :: GenUnit u -> UniqDSet ModuleName

Retrieve the set of free module holes of a Unit.

thisGhcUnitId :: UnitId

thisGhcUnit :: Unit

thUnitId :: UnitId

thUnit :: Unit

stringToUnitId :: String -> UnitId

stringToUnit :: String -> Unit

stableUnitCmp :: Unit -> Unit -> Ordering

Compares unit ids lexically, rather than by their Uniques

rtsUnitId :: UnitId

rtsUnit :: Unit

primUnitId :: UnitId

primUnit :: Unit

pprInstantiatedModule :: InstantiatedModule -> SDoc

moduleFreeHoles :: GenModule (GenUnit u) -> UniqDSet ModuleName

Calculate the free holes of a Module. If this set is non-empty, this module was defined in an indefinite library that had required signatures.

If a module has free holes, that means that substitutions can operate on it; if it has no free holes, substituting over a module has no effect.

mkVirtUnit :: IsUnitId u => Indefinite u -> [(ModuleName, GenModule (GenUnit u))] -> GenUnit u

Smart constructor for instantiated GenUnit

mkModule :: u -> ModuleName -> GenModule u

mkInstantiatedUnitHash :: IsUnitId u => Indefinite u -> [(ModuleName, GenModule (GenUnit u))] -> FastString

Generate a uniquely identifying hash (internal unit-id) for an instantiated unit.

This is a one-way function. If the indefinite unit has not been instantiated at all, we return its unit-id.

This hash is completely internal to GHC and is not used for symbol names or file paths. It is different from the hash Cabal would produce for the same instantiated unit.

mkInstantiatedUnit :: IsUnitId u => Indefinite u -> GenInstantiations u -> GenInstantiatedUnit u

Create a new GenInstantiatedUnit given an explicit module substitution.

mapInstantiations :: IsUnitId v => (u -> v) -> GenInstantiations u -> GenInstantiations v

Map over the unit identifier of unit instantiations.

mapGenUnit :: IsUnitId v => (u -> v) -> GenUnit u -> GenUnit v

Map over the unit type of a GenUnit

mainUnitId :: UnitId

This is the package Id for the current program. It is the default package Id if you don't specify a package name. We don't add this prefix to symbol names, since there can be only one main package per program.

mainUnit :: Unit

isInteractiveModule :: Module -> Bool

isHoleUnit :: GenUnit u -> Bool

interactiveUnitId :: UnitId

interactiveUnit :: Unit

fsToUnit :: FastString -> Unit

Create a new simple unit identifier from a FastString. Internally, this is primarily used to specify wired-in unit identifiers.

bignumUnitId :: UnitId

bignumUnit :: Unit

baseUnitId :: UnitId

baseUnit :: Unit

stableModuleNameCmp :: ModuleName -> ModuleName -> Ordering

Compares module names lexically, rather than by their Uniques

pprModuleName :: ModuleName -> SDoc

parseModuleName :: ReadP ModuleName

moduleNameString :: ModuleName -> String

moduleNameSlashes :: ModuleName -> String

Returns the string version of the module name, with dots replaced by slashes.

moduleNameFS :: ModuleName -> FastString

moduleNameColons :: ModuleName -> String

Returns the string version of the module name, with dots replaced by colons.

mkModuleNameFS :: FastString -> ModuleName

mkModuleName :: String -> ModuleName

unitIdFS :: UnitId -> FastString

The full hashed unit identifier, including the component id and the hash.

type Unit = GenUnit UnitId

type Module = GenModule Unit

A Module is a pair of a Unit and a ModuleName.

newtype Indefinite unit

Constructors

Indefinite

Fields

• indefUnit :: unit

Instances

Functor Indefinite

Defined in GHC.Unit.Types

Methods

fmap :: (a -> b) -> Indefinite a -> Indefinite b

(<$) :: a -> Indefinite b -> Indefinite a

Uniquable unit => Uniquable (Indefinite unit)

Defined in GHC.Unit.Types

Methods

getUnique :: Indefinite unit -> Unique

IsUnitId unit => IsUnitId (Indefinite unit)

Defined in GHC.Unit.Types

Methods

unitFS :: Indefinite unit -> FastString

Binary unit => Binary (Indefinite unit)

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> Indefinite unit -> IO ()

put :: BinHandle -> Indefinite unit -> IO (Bin (Indefinite unit))

get :: BinHandle -> IO (Indefinite unit)

Outputable unit => Outputable (Indefinite unit)

Defined in GHC.Unit.Types

Methods

ppr :: Indefinite unit -> SDoc

Eq unit => Eq (Indefinite unit)

Defined in GHC.Unit.Types

Methods

(==) :: Indefinite unit -> Indefinite unit -> Bool

(/=) :: Indefinite unit -> Indefinite unit -> Bool

Ord unit => Ord (Indefinite unit)

Defined in GHC.Unit.Types

Methods

compare :: Indefinite unit -> Indefinite unit -> Ordering

(<) :: Indefinite unit -> Indefinite unit -> Bool

(<=) :: Indefinite unit -> Indefinite unit -> Bool

(>) :: Indefinite unit -> Indefinite unit -> Bool

(>=) :: Indefinite unit -> Indefinite unit -> Bool

max :: Indefinite unit -> Indefinite unit -> Indefinite unit

min :: Indefinite unit -> Indefinite unit -> Indefinite unit

type IndefUnitId = Indefinite UnitId

An IndefUnitId is an UnitId with the invariant that it only refers to an indefinite library; i.e., one that can be instantiated.

data GenUnit uid

A unit identifier identifies a (possibly partially) instantiated library. It is primarily used as part of Module, which in turn is used in Name, which is used to give names to entities when typechecking.

There are two possible forms for a Unit:

1) It can be a RealUnit, in which case we just have a DefUnitId that uniquely identifies some fully compiled, installed library we have on disk.

2) It can be an VirtUnit. When we are typechecking a library with missing holes, we may need to instantiate a library on the fly (in which case we don't have any on-disk representation.) In that case, you have an InstantiatedUnit, which explicitly records the instantiation, so that we can substitute over it.

Constructors

RealUnit !(Definite uid)

Installed definite unit (either a fully instantiated unit or a closed unit)

VirtUnit !(GenInstantiatedUnit uid)

Virtual unit instantiated on-the-fly. It may be definite if all the holes are instantiated but we don't have code objects for it.

HoleUnit

Fake hole unit

Instances

Data Unit

Defined in GHC.Unit.Types

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Unit -> c Unit

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Unit

toConstr :: Unit -> Constr

dataTypeOf :: Unit -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Unit)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Unit)

gmapT :: (forall b. Data b => b -> b) -> Unit -> Unit

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Unit -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Unit -> r

gmapQ :: (forall d. Data d => d -> u) -> Unit -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> Unit -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> Unit -> m Unit

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit -> m Unit

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Unit -> m Unit

Show Module

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> Module -> ShowS

show :: Module -> String

showList :: [Module] -> ShowS

Show Unit

Defined in GHC.Unit.Types

Methods

showsPrec :: Int -> Unit -> ShowS

show :: Unit -> String

showList :: [Unit] -> ShowS

NFData Unit

Defined in GHC.Unit.Types

Methods

rnf :: Unit -> ()

Uniquable Module

Defined in GHC.Unit.Types

Methods

getUnique :: Module -> Unique

Binary Unit

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> Unit -> IO ()

put :: BinHandle -> Unit -> IO (Bin Unit)

get :: BinHandle -> IO Unit

Outputable Module

Defined in GHC.Unit.Types

Methods

ppr :: Module -> SDoc

Outputable Unit

Defined in GHC.Unit.Types

Methods

ppr :: Unit -> SDoc

Ord Unit

Defined in GHC.Unit.Types

Methods

compare :: Unit -> Unit -> Ordering

(<) :: Unit -> Unit -> Bool

(<=) :: Unit -> Unit -> Bool

(>) :: Unit -> Unit -> Bool

(>=) :: Unit -> Unit -> Bool

max :: Unit -> Unit -> Unit

min :: Unit -> Unit -> Unit

IsUnitId u => Uniquable (GenUnit u)

Defined in GHC.Unit.Types

Methods

getUnique :: GenUnit u -> Unique

IsUnitId u => IsUnitId (GenUnit u)

Defined in GHC.Unit.Types

Methods

unitFS :: GenUnit u -> FastString

IsUnitId u => Eq (GenUnit u)

Defined in GHC.Unit.Types

Methods

(==) :: GenUnit u -> GenUnit u -> Bool

(/=) :: GenUnit u -> GenUnit u -> Bool

data GenModule unit

A generic module is a pair of a unit identifier and a ModuleName.

Constructors

Module !unit !ModuleName

Instances

Functor GenModule

Defined in GHC.Unit.Types

Methods

fmap :: (a -> b) -> GenModule a -> GenModule b

(<$) :: a -> GenModule b -> GenModule a

Show Module

Defined in Development.IDE.GHC.Orphans

Methods

showsPrec :: Int -> Module -> ShowS

show :: Module -> String

showList :: [Module] -> ShowS

Uniquable Module

Defined in GHC.Unit.Types

Methods

getUnique :: Module -> Unique

Outputable InstalledModule

Defined in GHC.Unit.Types

Methods

ppr :: InstalledModule -> SDoc

Outputable InstantiatedModule

Defined in GHC.Unit.Types

Methods

ppr :: InstantiatedModule -> SDoc

Outputable Module

Defined in GHC.Unit.Types

Methods

ppr :: Module -> SDoc

Data unit => Data (GenModule unit)

Defined in GHC.Unit.Types

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> GenModule unit -> c (GenModule unit)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (GenModule unit)

toConstr :: GenModule unit -> Constr

dataTypeOf :: GenModule unit -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (GenModule unit))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (GenModule unit))

gmapT :: (forall b. Data b => b -> b) -> GenModule unit -> GenModule unit

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> GenModule unit -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> GenModule unit -> r

gmapQ :: (forall d. Data d => d -> u) -> GenModule unit -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> GenModule unit -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> GenModule unit -> m (GenModule unit)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> GenModule unit -> m (GenModule unit)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> GenModule unit -> m (GenModule unit)

NFData (GenModule a)

Defined in GHC.Unit.Types

Methods

rnf :: GenModule a -> ()

Binary a => Binary (GenModule a)

Defined in GHC.Unit.Types

Methods

put_ :: BinHandle -> GenModule a -> IO ()

put :: BinHandle -> GenModule a -> IO (Bin (GenModule a))

get :: BinHandle -> IO (GenModule a)

Eq unit => Eq (GenModule unit)

Defined in GHC.Unit.Types

Methods

(==) :: GenModule unit -> GenModule unit -> Bool

(/=) :: GenModule unit -> GenModule unit -> Bool

Ord unit => Ord (GenModule unit)

Defined in GHC.Unit.Types

Methods

compare :: GenModule unit -> GenModule unit -> Ordering

(<) :: GenModule unit -> GenModule unit -> Bool

(<=) :: GenModule unit -> GenModule unit -> Bool

(>) :: GenModule unit -> GenModule unit -> Bool

(>=) :: GenModule unit -> GenModule unit -> Bool

max :: GenModule unit -> GenModule unit -> GenModule unit

min :: GenModule unit -> GenModule unit -> GenModule unit

pprModule :: Module -> SDoc

data ModuleName

A ModuleName is essentially a simple string, e.g. Data.List.

Instances

Data ModuleName

Defined in GHC.Unit.Module.Name

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> ModuleName -> c ModuleName

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c ModuleName

toConstr :: ModuleName -> Constr

dataTypeOf :: ModuleName -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c ModuleName)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c ModuleName)

gmapT :: (forall b. Data b => b -> b) -> ModuleName -> ModuleName

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> ModuleName -> r

gmapQ :: (forall d. Data d => d -> u) -> ModuleName -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> ModuleName -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> ModuleName -> m ModuleName

Show ModuleName

Defined in GHC.Unit.Module.Name

Methods

showsPrec :: Int -> ModuleName -> ShowS

show :: ModuleName -> String

showList :: [ModuleName] -> ShowS

NFData ModuleName

Defined in GHC.Unit.Module.Name

Methods

rnf :: ModuleName -> ()

Uniquable ModuleName

Defined in GHC.Unit.Module.Name

Methods

getUnique :: ModuleName -> Unique

Binary ModuleName

Defined in GHC.Unit.Module.Name

Methods

put_ :: BinHandle -> ModuleName -> IO ()

put :: BinHandle -> ModuleName -> IO (Bin ModuleName)

get :: BinHandle -> IO ModuleName

Outputable ModuleName

Defined in GHC.Unit.Module.Name

Methods

ppr :: ModuleName -> SDoc

Eq ModuleName

Defined in GHC.Unit.Module.Name

Methods

(==) :: ModuleName -> ModuleName -> Bool

(/=) :: ModuleName -> ModuleName -> Bool

Ord ModuleName

Defined in GHC.Unit.Module.Name

Methods

compare :: ModuleName -> ModuleName -> Ordering

(<) :: ModuleName -> ModuleName -> Bool

(<=) :: ModuleName -> ModuleName -> Bool

(>) :: ModuleName -> ModuleName -> Bool

(>=) :: ModuleName -> ModuleName -> Bool

max :: ModuleName -> ModuleName -> ModuleName

min :: ModuleName -> ModuleName -> ModuleName

Hashable ModuleName

Defined in Development.IDE.GHC.Orphans

Methods

hashWithSalt :: Int -> ModuleName -> Int

hash :: ModuleName -> Int

ToHie (IEContext (LocatedA ModuleName))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]

type Anno ModuleName

Defined in GHC.Hs.ImpExp

type Anno ModuleName = SrcSpanAnnA

Syntax re-exports

data HsModule

Haskell Module

All we actually declare here is the top-level structure for a module.

Constructors

HsModule

Fields

• hsmodAnn :: EpAnn AnnsModule
• hsmodLayout :: LayoutInfo

  Layout info for the module. For incomplete modules (e.g. the output of parseHeader), it is NoLayoutInfo.

• hsmodName :: Maybe (LocatedA ModuleName)

  Nothing: "module X where" is omitted (in which case the next field is Nothing too)

• hsmodExports :: Maybe (LocatedL [LIE GhcPs])

  Export list

  • Nothing: export list omitted, so export everything
  • Just []: export nothing
  • Just [...]: as you would expect...
  • AnnKeywordIds : AnnOpen ,AnnClose
• hsmodImports :: [LImportDecl GhcPs]

  We snaffle interesting stuff out of the imported interfaces early on, adding that info to TyDecls/etc; so this list is often empty, downstream.

• hsmodDecls :: [LHsDecl GhcPs]

  Type, class, value, and interface signature decls

• hsmodDeprecMessage :: Maybe (LocatedP WarningTxt)

  reason/explanation for warning/deprecation of this module

  • AnnKeywordIds : AnnOpen ,AnnClose
• hsmodHaddockModHeader :: Maybe LHsDocString

  Haddock module info and description, unparsed

  • AnnKeywordIds : AnnOpen ,AnnClose

Instances

Data HsModule

Defined in GHC.Hs

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> HsModule -> c HsModule

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c HsModule

toConstr :: HsModule -> Constr

dataTypeOf :: HsModule -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c HsModule)

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c HsModule)

gmapT :: (forall b. Data b => b -> b) -> HsModule -> HsModule

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> HsModule -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> HsModule -> r

gmapQ :: (forall d. Data d => d -> u) -> HsModule -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> HsModule -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> HsModule -> m HsModule

NFData HsModule

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: HsModule -> ()

Outputable HsModule

Defined in GHC.Hs

Methods

ppr :: HsModule -> SDoc

data SrcSpanAnn' a

The 'SrcSpanAnn'' type wraps a normal SrcSpan, together with an extra annotation type. This is mapped to a specific GenLocated usage in the AST through the XRec and Anno type families.

Instances

Functor SrcSpanAnn'

Defined in Development.IDE.GHC.Orphans

Methods

fmap :: (a -> b) -> SrcSpanAnn' a -> SrcSpanAnn' b

(<$) :: a -> SrcSpanAnn' b -> SrcSpanAnn' a

Data a => Data (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> SrcSpanAnn' a -> c (SrcSpanAnn' a)

gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (SrcSpanAnn' a)

toConstr :: SrcSpanAnn' a -> Constr

dataTypeOf :: SrcSpanAnn' a -> DataType

dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (SrcSpanAnn' a))

dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (SrcSpanAnn' a))

gmapT :: (forall b. Data b => b -> b) -> SrcSpanAnn' a -> SrcSpanAnn' a

gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpanAnn' a -> r

gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> SrcSpanAnn' a -> r

gmapQ :: (forall d. Data d => d -> u) -> SrcSpanAnn' a -> [u]

gmapQi :: Int -> (forall d. Data d => d -> u) -> SrcSpanAnn' a -> u

gmapM :: Monad m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a)

gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a)

gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> SrcSpanAnn' a -> m (SrcSpanAnn' a)

Semigroup an => Semigroup (SrcSpanAnn' an)

Defined in GHC.Parser.Annotation

Methods

(<>) :: SrcSpanAnn' an -> SrcSpanAnn' an -> SrcSpanAnn' an

sconcat :: NonEmpty (SrcSpanAnn' an) -> SrcSpanAnn' an

stimes :: Integral b => b -> SrcSpanAnn' an -> SrcSpanAnn' an

NFData (SrcSpanAnn' a)

Defined in Development.IDE.GHC.Orphans

Methods

rnf :: SrcSpanAnn' a -> ()

Binary a => Binary (LocatedL a)

Defined in GHC.Parser.Annotation

Methods

put_ :: BinHandle -> LocatedL a -> IO ()

put :: BinHandle -> LocatedL a -> IO (Bin (LocatedL a))

get :: BinHandle -> IO (LocatedL a)

Outputable a => Outputable (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

ppr :: SrcSpanAnn' a -> SDoc

Eq a => Eq (SrcSpanAnn' a)

Defined in GHC.Parser.Annotation

Methods

(==) :: SrcSpanAnn' a -> SrcSpanAnn' a -> Bool

(/=) :: SrcSpanAnn' a -> SrcSpanAnn' a -> Bool

HasSrcSpan (SrcSpanAnn' ann)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: SrcSpanAnn' ann -> SrcSpan

HasLoc (LocatedA a)

Defined in Compat.HieAst

Methods

loc :: LocatedA a -> SrcSpan

HasLoc (LocatedN a)

Defined in Compat.HieAst

Methods

loc :: LocatedN a -> SrcSpan

HiePass p => HasType (LocatedA (HsBind (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsBind (GhcPass p)) -> HieM [HieAST Type]

HiePass p => HasType (LocatedA (HsExpr (GhcPass p)))

This instance tries to construct HieAST nodes which include the type of the expression. It is not yet possible to do this efficiently for all expression forms, so we skip filling in the type for those inputs.

HsApp, for example, doesn't have any type information available directly on the node. Our next recourse would be to desugar it into a CoreExpr then query the type of that. Yet both the desugaring call and the type query both involve recursive calls to the function and argument! This is particularly problematic when you realize that the HIE traversal will eventually visit those nodes too and ask for their types again.

Since the above is quite costly, we just skip cases where computing the expression's type is going to be expensive.

See #16233

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => HasType (LocatedA (Pat (GhcPass p)))

Defined in Compat.HieAst

Methods

getTypeNode :: LocatedA (Pat (GhcPass p)) -> HieM [HieAST Type]

ToHie (LBooleanFormula (LocatedN Name))

Defined in Compat.HieAst

Methods

toHie :: LBooleanFormula (LocatedN Name) -> HieM [HieAST Type]

ToHie (LocatedA (ImportDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ImportDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA HsWrapper)

Defined in Compat.HieAst

Methods

toHie :: LocatedA HsWrapper -> HieM [HieAST Type]

ToHie (LocatedA (FixitySig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FixitySig GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (AnnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (AnnDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ClsInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ClsInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ConDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DataFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DataFamInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DefaultDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DefaultDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (DerivDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (DerivDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (FamilyDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FamilyDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (ForeignDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ForeignDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (FunDep GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (FunDep GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (InstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (InstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RoleAnnotDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RoleAnnotDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RuleDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (RuleDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (RuleDecls GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (SpliceDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (SpliceDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (StandaloneKindSig GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (StandaloneKindSig GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (TyClDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyClDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (TyFamInstDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (TyFamInstDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (WarnDecl GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecl GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (WarnDecls GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (WarnDecls GhcRn) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsCmd (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsCmd (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsExpr (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsExpr (GhcPass p)) -> HieM [HieAST Type]

HiePass p => ToHie (LocatedA (HsSplice (GhcPass p)))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsSplice (GhcPass p)) -> HieM [HieAST Type]

(HiePass p, Data (body (GhcPass p)), AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (Match (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

ToHie (LocatedA (ConDeclField GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (ConDeclField GhcRn) -> HieM [HieAST Type]

ToHie (LocatedA (HsType GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedA (HsType GhcRn) -> HieM [HieAST Type]

ToHie (LocatedC (DerivClauseTys GhcRn))

Defined in Compat.HieAst

Methods

toHie :: LocatedC (DerivClauseTys GhcRn) -> HieM [HieAST Type]

ToHie (LocatedC [LocatedA (HsType GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedC [LocatedA (HsType GhcRn)] -> HieM [HieAST Type]

ToHie (LocatedL [LocatedA (ConDeclField GhcRn)])

Defined in Compat.HieAst

Methods

toHie :: LocatedL [LocatedA (ConDeclField GhcRn)] -> HieM [HieAST Type]

ToHie (LocatedP OverlapMode)

Defined in Compat.HieAst

Methods

toHie :: LocatedP OverlapMode -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))))

Defined in Compat.HieAst

Methods

toHie :: Located (GRHS (GhcPass p) (LocatedA (body (GhcPass p)))) -> HieM [HieAST Type]

HiePass p => ToHie (BindContext (LocatedA (HsBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: BindContext (LocatedA (HsBind (GhcPass p))) -> HieM [HieAST Type]

ToHie (Context (Located a)) => ToHie (Context (LocatedA a))

Defined in Compat.HieAst

Methods

toHie :: Context (LocatedA a) -> HieM [HieAST Type]

ToHie (Context (Located a)) => ToHie (Context (LocatedN a))

Defined in Compat.HieAst

Methods

toHie :: Context (LocatedN a) -> HieM [HieAST Type]

ToHie (EvBindContext (LocatedA TcEvBinds))

Defined in Compat.HieAst

Methods

toHie :: EvBindContext (LocatedA TcEvBinds) -> HieM [HieAST Type]

ToHie (IEContext (LIEWrappedName Name))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LIEWrappedName Name) -> HieM [HieAST Type]

ToHie (IEContext (LocatedA (IE GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA (IE GhcRn)) -> HieM [HieAST Type]

ToHie (IEContext (LocatedA ModuleName))

Defined in Compat.HieAst

Methods

toHie :: IEContext (LocatedA ModuleName) -> HieM [HieAST Type]

HiePass p => ToHie (PScoped (LocatedA (Pat (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: PScoped (LocatedA (Pat (GhcPass p))) -> HieM [HieAST Type]

(ToHie (RFContext (Located label)), ToHie arg, HasLoc arg, Data arg, Data label) => ToHie (RContext (LocatedA (HsRecField' label arg)))

Defined in Compat.HieAst

Methods

toHie :: RContext (LocatedA (HsRecField' label arg)) -> HieM [HieAST Type]

HiePass p => ToHie (RScoped (LocatedA (IPBind (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (IPBind (GhcPass p))) -> HieM [HieAST Type]

(ToHie (LocatedA (body (GhcPass p))), AnnoBody p body, HiePass p) => ToHie (RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))))

Defined in Compat.HieAst

Methods

toHie :: RScoped (LocatedA (Stmt (GhcPass p) (LocatedA (body (GhcPass p))))) -> HieM [HieAST Type]

HiePass p => ToHie (SigContext (LocatedA (Sig (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: SigContext (LocatedA (Sig (GhcPass p))) -> HieM [HieAST Type]

ToHie (TScoped (LocatedA (HsSigType GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TScoped (LocatedA (HsSigType GhcRn)) -> HieM [HieAST Type]

ToHie (TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (FamEqn GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsSigType GhcRn))) -> HieM [HieAST Type]

ToHie (TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))))

Defined in Compat.HieAst

Methods

toHie :: TScoped (HsWildCardBndrs GhcRn (LocatedA (HsType GhcRn))) -> HieM [HieAST Type]

Data flag => ToHie (TVScoped (LocatedA (HsTyVarBndr flag GhcRn)))

Defined in Compat.HieAst

Methods

toHie :: TVScoped (LocatedA (HsTyVarBndr flag GhcRn)) -> HieM [HieAST Type]

NamedThing (Located a) => NamedThing (LocatedAn an a)

Defined in GHC.Parser.Annotation

Methods

getOccName :: LocatedAn an a -> OccName

getName :: LocatedAn an a -> Name

(Outputable a, Outputable e) => Outputable (GenLocated (SrcSpanAnn' a) e)

Defined in GHC.Parser.Annotation

Methods

ppr :: GenLocated (SrcSpanAnn' a) e -> SDoc

HasSrcSpan (GenLocated (SrcSpanAnn' ann) a)

Defined in Development.IDE.GHC.Compat.Core

Methods

getLoc :: GenLocated (SrcSpanAnn' ann) a -> SrcSpan

(ToHie (LocatedA (body (GhcPass p))), HiePass p, AnnoBody p body) => ToHie (GRHSs (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: GRHSs (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

(HiePass p, AnnoBody p body, ToHie (LocatedA (body (GhcPass p)))) => ToHie (MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))))

Defined in Compat.HieAst

Methods

toHie :: MatchGroup (GhcPass p) (LocatedA (body (GhcPass p))) -> HieM [HieAST Type]

type Anno (LocatedA (IE (GhcPass p)))

Defined in GHC.Hs.ImpExp

type Anno (LocatedA (IE (GhcPass p))) = SrcSpanAnnA

type Anno (LocatedN Name)

Defined in GHC.Hs.Binds

type Anno (LocatedN Name) = SrcSpan

type Anno (LocatedN RdrName)

Defined in GHC.Hs.Binds

type Anno (LocatedN RdrName) = SrcSpan

type Anno (LocatedN Id)

Defined in GHC.Hs.Binds

type Anno (LocatedN Id) = SrcSpan

type Anno [LocatedA (IE (GhcPass p))]

Defined in GHC.Hs.ImpExp

type Anno [LocatedA (IE (GhcPass p))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))] = SrcSpanAnnL

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.PostProcess

type Anno [LocatedA (Match GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))]

Defined in GHC.Hs.Expr

type Anno [LocatedA (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (body (GhcPass pr))))] = SrcSpanAnnL

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))]

Defined in GHC.Parser.Types

type Anno [LocatedA (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))] = SrcSpanAnnL

type Anno [LocatedA (ConDeclField (GhcPass _1))]

Defined in GHC.Hs.Decls

type Anno [LocatedA (ConDeclField (GhcPass _1))] = SrcSpanAnnL

type Anno [LocatedA (HsType (GhcPass p))]

Defined in GHC.Hs.Type

type Anno [LocatedA (HsType (GhcPass p))] = SrcSpanAnnC

type Anno [LocatedN Name]

Defined in GHC.Hs.Binds

type Anno [LocatedN Name] = SrcSpan

type Anno [LocatedN RdrName]

Defined in GHC.Hs.Binds

type Anno [LocatedN RdrName] = SrcSpan

type Anno [LocatedN Id]

Defined in GHC.Hs.Binds

type Anno [LocatedN Id] = SrcSpan

type Anno (FamEqn p (LocatedA (HsType p)))

Defined in GHC.Hs.Decls

type Anno (FamEqn p (LocatedA (HsType p))) = SrcSpanAnnA

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpan

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (GRHS (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpan

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (GRHS GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpan

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsCmd (GhcPass p)))) = SrcSpanAnnA

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Expr

type Anno (Match (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (Match GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p))))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (GhcPass p) (LocatedA (HsExpr (GhcPass p)))) = SrcSpanAnnA

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p)))

Defined in GHC.Hs.Pat

type Anno (HsRecField' (AmbiguousFieldOcc p) (LocatedA (HsExpr p))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsCmd (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr))))

Defined in GHC.Hs.Expr

type Anno (StmtLR (GhcPass pl) (GhcPass pr) (LocatedA (HsExpr (GhcPass pr)))) = SrcSpanAnnA

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs)))

Defined in GHC.Parser.PostProcess

type Anno (StmtLR GhcPs GhcPs (LocatedA (PatBuilder GhcPs))) = SrcSpanAnnA

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn)))

Defined in GHC.Hs.Expr

type Anno (StmtLR GhcRn GhcRn (LocatedA (body GhcRn))) = SrcSpanAnnA

module GHC.Hs.Binds

module GHC.Parser

optionsErrorMsgs :: [String] -> [Located String] -> FilePath -> Messages DecoratedSDoc

mkPrelImports :: ModuleName -> SrcSpan -> Bool -> [LImportDecl GhcPs] -> [LImportDecl GhcPs]

getOptionsFromFile

Arguments

:: DynFlags

-> FilePath

Input file

-> IO [Located String]

Parsed options, if any.

Parse OPTIONS and LANGUAGE pragmas of the source file.

Throws a SourceError if flag parsing fails (including unsupported flags.)

getOptions

Arguments

:: DynFlags

-> StringBuffer

Input Buffer

-> FilePath

Source filename. Used for location info.

-> [Located String]

Parsed options.

Parse OPTIONS and LANGUAGE pragmas of the source file.

Throws a SourceError if flag parsing fails (including unsupported flags.)

checkProcessArgsResult :: MonadIO m => [Located String] -> m ()

Complain about non-dynamic flags in OPTIONS pragmas.

Throws a SourceError if the input list is non-empty claiming that the input flags are unknown.

data Token

Constructors

ITas

ITcase

ITclass

ITdata

ITdefault

ITderiving

ITdo (Maybe FastString)

ITelse

IThiding

ITforeign

ITif

ITimport

ITin

ITinfix

ITinfixl

ITinfixr

ITinstance

ITlet

ITmodule

ITnewtype

ITof

ITqualified

ITthen

ITtype

ITwhere

ITforall IsUnicodeSyntax

ITexport

ITlabel

ITdynamic

ITsafe

ITinterruptible

ITunsafe

ITstdcallconv

ITccallconv

ITcapiconv

ITprimcallconv

ITjavascriptcallconv

ITmdo (Maybe FastString)

ITfamily

ITrole

ITgroup

ITby

ITusing

ITpattern

ITstatic

ITstock

ITanyclass

ITvia

ITunit

ITsignature

ITdependency

ITrequires

ITinline_prag SourceText InlineSpec RuleMatchInfo

ITspec_prag SourceText

ITspec_inline_prag SourceText Bool

ITsource_prag SourceText

ITrules_prag SourceText

ITwarning_prag SourceText

ITdeprecated_prag SourceText

ITline_prag SourceText

ITcolumn_prag SourceText

ITscc_prag SourceText

ITunpack_prag SourceText

ITnounpack_prag SourceText

ITann_prag SourceText

ITcomplete_prag SourceText

ITclose_prag

IToptions_prag String

ITinclude_prag String

ITlanguage_prag

ITminimal_prag SourceText

IToverlappable_prag SourceText

IToverlapping_prag SourceText

IToverlaps_prag SourceText

ITincoherent_prag SourceText

ITctype SourceText

ITcomment_line_prag

ITdotdot

ITcolon

ITdcolon IsUnicodeSyntax

ITequal

ITlam

ITlcase

ITvbar

ITlarrow IsUnicodeSyntax

ITrarrow IsUnicodeSyntax

ITdarrow IsUnicodeSyntax

ITlolly

ITminus

ITprefixminus

ITbang

ITtilde

ITat

ITtypeApp

ITpercent

ITstar IsUnicodeSyntax

ITdot

ITproj Bool

ITbiglam

ITocurly

ITccurly

ITvocurly

ITvccurly

ITobrack

ITopabrack

ITcpabrack

ITcbrack

IToparen

ITcparen

IToubxparen

ITcubxparen

ITsemi

ITcomma

ITunderscore

ITbackquote

ITsimpleQuote

ITvarid FastString

ITconid FastString

ITvarsym FastString

ITconsym FastString

ITqvarid (FastString, FastString)

ITqconid (FastString, FastString)

ITqvarsym (FastString, FastString)

ITqconsym (FastString, FastString)

ITdupipvarid FastString

ITlabelvarid FastString

ITchar SourceText Char

ITstring SourceText FastString

ITinteger IntegralLit

ITrational FractionalLit

ITprimchar SourceText Char

ITprimstring SourceText ByteString

ITprimint SourceText Integer

ITprimword SourceText Integer

ITprimfloat FractionalLit

ITprimdouble FractionalLit

ITopenExpQuote HasE IsUnicodeSyntax

ITopenPatQuote

ITopenDecQuote

ITopenTypQuote

ITcloseQuote IsUnicodeSyntax

ITopenTExpQuote HasE

ITcloseTExpQuote

ITdollar

ITdollardollar

ITtyQuote

ITquasiQuote (FastString, FastString, PsSpan)

ITqQuasiQuote (FastString, FastString, FastString, PsSpan)

ITproc

ITrec

IToparenbar IsUnicodeSyntax

(|

ITcparenbar IsUnicodeSyntax

|)

ITlarrowtail IsUnicodeSyntax

-<

ITrarrowtail IsUnicodeSyntax

>-

ITLarrowtail IsUnicodeSyntax

-<<

ITRarrowtail IsUnicodeSyntax

>>-

ITunknown String

Used when the lexer can't make sense of it

ITeof

end of file token

ITdocCommentNext String PsSpan

something beginning -- |

ITdocCommentPrev String PsSpan

something beginning -- ^

ITdocCommentNamed String PsSpan

something beginning -- $

ITdocSection Int String PsSpan

a section heading

ITdocOptions String PsSpan

doc options (prune, ignore-exports, etc)

ITlineComment String PsSpan

comment starting by "--"

ITblockComment String PsSpan

comment in {- -}

Instances

Show Token

Defined in GHC.Parser.Lexer

Methods

showsPrec :: Int -> Token -> ShowS

show :: Token -> String

showList :: [Token] -> ShowS

Outputable Token

Defined in GHC.Parser.Lexer

Methods

ppr :: Token -> SDoc

data ParserOpts

Parser options.

See mkParserOpts to construct this.

Constructors

ParserOpts

Fields

• pWarningFlags :: EnumSet WarningFlag

  enabled warning flags

• pExtsBitmap :: !ExtsBitmap

  bitmap of permitted extensions

data ParseResult a

The result of running a parser.

Constructors

POk

The parser has consumed a (possibly empty) prefix of the input and produced a result. Use getMessages to check for accumulated warnings and non-fatal errors.

Fields

• PState

  The resulting parsing state. Can be used to resume parsing.

• a

  The resulting value.

PFailed

The parser has consumed a (possibly empty) prefix of the input and failed.

Fields

• PState

  The parsing state right before failure, including the fatal parse error. getMessages and getErrorMessages must return a non-empty bag of errors.

data PState

Constructors

PState

Fields

• buffer :: StringBuffer
• options :: ParserOpts
• warnings :: Bag PsWarning
• errors :: Bag PsError
• tab_first :: Maybe RealSrcSpan
• tab_count :: !Word
• last_tk :: Maybe (PsLocated Token)
• prev_loc :: PsSpan
• prev_loc2 :: PsSpan
• last_loc :: PsSpan
• last_len :: !Int
• loc :: PsLoc
• context :: [LayoutContext]
• lex_state :: [Int]
• srcfiles :: [FastString]
• alr_pending_implicit_tokens :: [PsLocated Token]
• alr_next_token :: Maybe (PsLocated Token)
• alr_last_loc :: PsSpan
• alr_context :: [ALRContext]
• alr_expecting_ocurly :: Maybe ALRLayout
• alr_justClosedExplicitLetBlock :: Bool
• eof_pos :: Maybe (RealSrcSpan, RealSrcSpan)
• header_comments :: Maybe [LEpaComment]
• comment_q :: [LEpaComment]
• hdk_comments :: OrdList (PsLocated HdkComment)

newtype P a

The parsing monad, isomorphic to StateT PState Maybe.

Constructors

P

Fields

• unP :: PState -> ParseResult a

Instances

Applicative P

Defined in GHC.Parser.Lexer

Methods

pure :: a -> P a

(<*>) :: P (a -> b) -> P a -> P b

liftA2 :: (a -> b -> c) -> P a -> P b -> P c

(*>) :: P a -> P b -> P b

(<*) :: P a -> P b -> P a

Functor P

Defined in GHC.Parser.Lexer

Methods

fmap :: (a -> b) -> P a -> P b

(<$) :: a -> P b -> P a

Monad P

Defined in GHC.Parser.Lexer

Methods

(>>=) :: P a -> (a -> P b) -> P b

(>>) :: P a -> P b -> P b

return :: a -> P a

MonadP P

Defined in GHC.Parser.Lexer

Methods

addError :: PsError -> P ()

addWarning :: WarningFlag -> PsWarning -> P ()

addFatalError :: PsError -> P a

getBit :: ExtBits -> P Bool

allocateCommentsP :: RealSrcSpan -> P EpAnnComments

allocatePriorCommentsP :: RealSrcSpan -> P EpAnnComments

allocateFinalCommentsP :: RealSrcSpan -> P EpAnnComments

class Monad m => MonadP (m :: Type -> Type) where

An mtl-style class for monads that support parsing-related operations. For example, sometimes we make a second pass over the parsing results to validate, disambiguate, or rearrange them, and we do so in the PV monad which cannot consume input but can report parsing errors, check for extension bits, and accumulate parsing annotations. Both P and PV are instances of MonadP.

MonadP grants us convenient overloading. The other option is to have separate operations for each monad: addErrorP vs addErrorPV, getBitP vs getBitPV, and so on.

Methods

addError :: PsError -> m ()

Add a non-fatal error. Use this when the parser can produce a result despite the error.

For example, when GHC encounters a forall in a type, but -XExplicitForAll is disabled, the parser constructs ForAllTy as if -XExplicitForAll was enabled, adding a non-fatal error to the accumulator.

Control flow wise, non-fatal errors act like warnings: they are added to the accumulator and parsing continues. This allows GHC to report more than one parse error per file.

addWarning :: WarningFlag -> PsWarning -> m ()

Add a warning to the accumulator. Use getMessages to get the accumulated warnings.

addFatalError :: PsError -> m a

Add a fatal error. This will be the last error reported by the parser, and the parser will not produce any result, ending in a PFailed state.

getBit :: ExtBits -> m Bool

Check if a given flag is currently set in the bitmap.

allocateCommentsP :: RealSrcSpan -> m EpAnnComments

Go through the comment_q in PState and remove all comments that belong within the given span

allocatePriorCommentsP :: RealSrcSpan -> m EpAnnComments

Go through the comment_q in PState and remove all comments that come before or within the given span

allocateFinalCommentsP :: RealSrcSpan -> m EpAnnComments

Go through the comment_q in PState and remove all comments that come after the given span

Instances

MonadP P

Defined in GHC.Parser.Lexer

Methods

addError :: PsError -> P ()

addWarning :: WarningFlag -> PsWarning -> P ()

addFatalError :: PsError -> P a

getBit :: ExtBits -> P Bool

allocateCommentsP :: RealSrcSpan -> P EpAnnComments

allocatePriorCommentsP :: RealSrcSpan -> P EpAnnComments

allocateFinalCommentsP :: RealSrcSpan -> P EpAnnComments

MonadP PV

Defined in GHC.Parser.PostProcess

Methods

addError :: PsError -> PV ()

addWarning :: WarningFlag -> PsWarning -> PV ()

addFatalError :: PsError -> PV a

getBit :: ExtBits -> PV Bool

allocateCommentsP :: RealSrcSpan -> PV EpAnnComments

allocatePriorCommentsP :: RealSrcSpan -> PV EpAnnComments

allocateFinalCommentsP :: RealSrcSpan -> PV EpAnnComments

data HdkComment

Haddock comment as produced by the lexer. These are accumulated in PState and then processed in GHC.Parser.PostProcess.Haddock.

Constructors

HdkCommentNext HsDocString

HdkCommentPrev HsDocString

HdkCommentNamed String HsDocString

HdkCommentSection Int HsDocString

Instances

Show HdkComment

Defined in GHC.Parser.Lexer

Methods

showsPrec :: Int -> HdkComment -> ShowS

show :: HdkComment -> String

showList :: [HdkComment] -> ShowS

data ExtBits

Various boolean flags, mostly language extensions, that impact lexing and parsing. Note that a handful of these can change during lexing/parsing.

Constructors

FfiBit

InterruptibleFfiBit

CApiFfiBit

ArrowsBit

ThBit

ThQuotesBit

IpBit

OverloadedLabelsBit

ExplicitForallBit

BangPatBit

PatternSynonymsBit

HaddockBit

MagicHashBit

RecursiveDoBit

QualifiedDoBit

UnicodeSyntaxBit

UnboxedTuplesBit

UnboxedSumsBit

DatatypeContextsBit

MonadComprehensionsBit

TransformComprehensionsBit

QqBit

RawTokenStreamBit

AlternativeLayoutRuleBit

ALRTransitionalBit

RelaxedLayoutBit

NondecreasingIndentationBit

SafeHaskellBit

TraditionalRecordSyntaxBit

ExplicitNamespacesBit

LambdaCaseBit

BinaryLiteralsBit

NegativeLiteralsBit

HexFloatLiteralsBit

StaticPointersBit

NumericUnderscoresBit

StarIsTypeBit

BlockArgumentsBit

NPlusKPatternsBit

DoAndIfThenElseBit

MultiWayIfBit

GadtSyntaxBit

ImportQualifiedPostBit

LinearTypesBit

NoLexicalNegationBit

OverloadedRecordDotBit

OverloadedRecordUpdateBit

InRulePragBit

InNestedCommentBit

UsePosPragsBit

If this is enabled, '{-# LINE ... -#}' and '{-# COLUMN ... #-}' update the internal position. Otherwise, those pragmas are lexed as tokens of their own.

Instances

Enum ExtBits

Defined in GHC.Parser.Lexer

Methods

succ :: ExtBits -> ExtBits

pred :: ExtBits -> ExtBits

toEnum :: Int -> ExtBits

fromEnum :: ExtBits -> Int

enumFrom :: ExtBits -> [ExtBits]

enumFromThen :: ExtBits -> ExtBits -> [ExtBits]

enumFromTo :: ExtBits -> ExtBits -> [ExtBits]

enumFromThenTo :: ExtBits -> ExtBits -> ExtBits -> [ExtBits]

xunset :: ExtBits -> ExtsBitmap -> ExtsBitmap

xtest :: ExtBits -> ExtsBitmap -> Bool

xset :: ExtBits -> ExtsBitmap -> ExtsBitmap

warnopt :: WarningFlag -> ParserOpts -> Bool

Test whether a WarningFlag is set

srcParseFail :: P a

setSrcLoc :: RealSrcLoc -> P ()

setLastToken :: PsSpan -> Int -> P ()

pushModuleContext :: P ()

pushLexState :: Int -> P ()

popLexState :: P Int

popContext :: P ()

nextIsEOF :: P Bool

mkParserOpts

Arguments

:: EnumSet WarningFlag

warnings flags enabled

-> EnumSet Extension

permitted language extensions enabled

-> Bool

are safe imports on?

-> Bool

keeping Haddock comment tokens

-> Bool

keep regular comment tokens

-> Bool

If this is enabled, '{-# LINE ... -#}' and '{-# COLUMN ... #-}' update the internal position kept by the parser. Otherwise, those pragmas are lexed as ITline_prag and ITcolumn_prag tokens.

-> ParserOpts

Given exactly the information needed, set up the ParserOpts

mkParensEpAnn :: RealSrcSpan -> (AddEpAnn, AddEpAnn)

Given a SrcSpan that surrounds a HsPar or HsParTy, generate AddEpAnn values for the opening and closing bordering on the start and end of the span

lexerDbg :: Bool -> (Located Token -> P a) -> P a

lexer :: Bool -> (Located Token -> P a) -> P a

lexTokenStream :: ParserOpts -> StringBuffer -> RealSrcLoc -> ParseResult [Located Token]

initPragState :: ParserOpts -> StringBuffer -> RealSrcLoc -> PState

Set parser options for parsing OPTIONS pragmas

getRealSrcLoc :: P RealSrcLoc

getPriorCommentsFor :: MonadP m => SrcSpan -> m EpAnnComments

getPState :: P PState

getMessages :: PState -> (Bag PsWarning, Bag PsError)

Get the warnings and errors accumulated so far. Does not take -Werror into account.

getLexState :: P Int

getFinalCommentsFor :: MonadP m => SrcSpan -> m EpAnnComments

getErrorMessages :: PState -> Bag PsError

Get a bag of the errors that have been accumulated so far. Does not take -Werror into account.

getEofPos :: P (Maybe (RealSrcSpan, RealSrcSpan))

getCommentsFor :: MonadP m => SrcSpan -> m EpAnnComments

failMsgP :: (SrcSpan -> PsError) -> P a

failLocMsgP :: RealSrcLoc -> RealSrcLoc -> (SrcSpan -> PsError) -> P a

commentToAnnotation :: RealLocated Token -> LEpaComment

allocatePriorComments :: RealSrcSpan -> [LEpaComment] -> Maybe [LEpaComment] -> (Maybe [LEpaComment], [LEpaComment], [LEpaComment])

allocateFinalComments :: RealSrcSpan -> [LEpaComment] -> Maybe [LEpaComment] -> (Maybe [LEpaComment], [LEpaComment], [LEpaComment])

allocateComments :: RealSrcSpan -> [LEpaComment] -> ([LEpaComment], [LEpaComment])

activeContext :: P Bool

pattern HsFieldBind :: XHsRecField id -> id -> arg -> Bool -> HsRecField' id arg

hfbAnn :: HsRecField' id arg -> XHsRecField id

hfbLHS :: HsRecField' id arg -> id

hfbRHS :: HsRecField' id arg -> arg

hfbPun :: HsRecField' id arg -> Bool

data Extension

The language extensions known to GHC.

Note that there is an orphan Binary instance for this type supplied by the GHC.LanguageExtensions module provided by ghc-boot. We can't provide here as this would require adding transitive dependencies to the template-haskell package, which must have a minimal dependency set.

Constructors

OverlappingInstances

UndecidableInstances

IncoherentInstances

UndecidableSuperClasses

MonomorphismRestriction

MonoLocalBinds

DeepSubsumption

RelaxedPolyRec

ExtendedDefaultRules

ForeignFunctionInterface

UnliftedFFITypes

InterruptibleFFI

CApiFFI

GHCForeignImportPrim

JavaScriptFFI

ParallelArrays

Arrows

TemplateHaskell

TemplateHaskellQuotes

QualifiedDo

QuasiQuotes

ImplicitParams

ImplicitPrelude

ScopedTypeVariables

AllowAmbiguousTypes

UnboxedTuples

UnboxedSums

UnliftedNewtypes

UnliftedDatatypes

BangPatterns

TypeFamilies

TypeFamilyDependencies

TypeInType

OverloadedStrings

OverloadedLists

NumDecimals

DisambiguateRecordFields

RecordWildCards

RecordPuns

ViewPatterns

GADTs

GADTSyntax

NPlusKPatterns

DoAndIfThenElse

BlockArguments

RebindableSyntax

ConstraintKinds

PolyKinds

DataKinds

InstanceSigs

ApplicativeDo

LinearTypes

StandaloneDeriving

DeriveDataTypeable

AutoDeriveTypeable

DeriveFunctor

DeriveTraversable

DeriveFoldable

DeriveGeneric

DefaultSignatures

DeriveAnyClass

DeriveLift

DerivingStrategies

DerivingVia

TypeSynonymInstances

FlexibleContexts

FlexibleInstances

ConstrainedClassMethods

MultiParamTypeClasses

NullaryTypeClasses

FunctionalDependencies

UnicodeSyntax

ExistentialQuantification

MagicHash

EmptyDataDecls

KindSignatures

RoleAnnotations

ParallelListComp

TransformListComp

MonadComprehensions

GeneralizedNewtypeDeriving

RecursiveDo

PostfixOperators

TupleSections

PatternGuards

LiberalTypeSynonyms

RankNTypes

ImpredicativeTypes

TypeOperators

ExplicitNamespaces

PackageImports

ExplicitForAll

AlternativeLayoutRule

AlternativeLayoutRuleTransitional

DatatypeContexts

NondecreasingIndentation

RelaxedLayout

TraditionalRecordSyntax

LambdaCase

MultiWayIf

BinaryLiterals

NegativeLiterals

HexFloatLiterals

DuplicateRecordFields

OverloadedLabels

EmptyCase

PatternSynonyms

PartialTypeSignatures

NamedWildCards

StaticPointers

TypeApplications

Strict

StrictData

EmptyDataDeriving

NumericUnderscores

QuantifiedConstraints

StarIsType

ImportQualifiedPost

CUSKs

StandaloneKindSignatures

LexicalNegation

FieldSelectors

OverloadedRecordDot

OverloadedRecordUpdate

Bundled Patterns

pattern NamedFieldPuns :: Extension

Instances

Bounded Extension

Defined in GHC.LanguageExtensions.Type

Methods

minBound :: Extension

maxBound :: Extension

Enum Extension

Defined in GHC.LanguageExtensions.Type

Methods

succ :: Extension -> Extension

pred :: Extension -> Extension

toEnum :: Int -> Extension

fromEnum :: Extension -> Int

enumFrom :: Extension -> [Extension]

enumFromThen :: Extension -> Extension -> [Extension]

enumFromTo :: Extension -> Extension -> [Extension]

enumFromThenTo :: Extension -> Extension -> Extension -> [Extension]

Generic Extension

Defined in GHC.LanguageExtensions.Type

Associated Types

type Rep Extension :: Type -> Type

Methods

from :: Extension -> Rep Extension x

to :: Rep Extension x -> Extension

Show Extension

Defined in GHC.LanguageExtensions.Type

Methods

showsPrec :: Int -> Extension -> ShowS

show :: Extension -> String

showList :: [Extension] -> ShowS

Outputable Extension

Defined in GHC.Utils.Outputable

Methods

ppr :: Extension -> SDoc

Eq Extension

Defined in GHC.LanguageExtensions.Type

Methods

(==) :: Extension -> Extension -> Bool

(/=) :: Extension -> Extension -> Bool

Ord Extension

Defined in GHC.LanguageExtensions.Type

Methods

compare :: Extension -> Extension -> Ordering

(<) :: Extension -> Extension -> Bool

(<=) :: Extension -> Extension -> Bool

(>) :: Extension -> Extension -> Bool

(>=) :: Extension -> Extension -> Bool

max :: Extension -> Extension -> Extension

min :: Extension -> Extension -> Extension

type Rep Extension

Defined in GHC.LanguageExtensions.Type

type Rep Extension = D1 ('MetaData "Extension" "GHC.LanguageExtensions.Type" "ghc-boot-th-9.2.4" 'False) ((((((C1 ('MetaCons "Cpp" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "OverlappingInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UndecidableInstances" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "IncoherentInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UndecidableSuperClasses" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "MonomorphismRestriction" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MonoLocalBinds" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "DeepSubsumption" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RelaxedPolyRec" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ExtendedDefaultRules" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ForeignFunctionInterface" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "UnliftedFFITypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "InterruptibleFFI" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CApiFFI" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GHCForeignImportPrim" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "JavaScriptFFI" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ParallelArrays" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "Arrows" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TemplateHaskell" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TemplateHaskellQuotes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "QualifiedDo" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "QuasiQuotes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImplicitParams" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "ImplicitPrelude" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ScopedTypeVariables" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "AllowAmbiguousTypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnboxedTuples" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "UnboxedSums" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnliftedNewtypes" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "UnliftedDatatypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "BangPatterns" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: ((((C1 ('MetaCons "TypeFamilies" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "TypeFamilyDependencies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TypeInType" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "OverloadedStrings" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "OverloadedLists" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "NumDecimals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DisambiguateRecordFields" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "RecordWildCards" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RecordPuns" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "ViewPatterns" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "GADTs" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "GADTSyntax" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NPlusKPatterns" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DoAndIfThenElse" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "BlockArguments" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "RebindableSyntax" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ConstraintKinds" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PolyKinds" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DataKinds" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "InstanceSigs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ApplicativeDo" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LinearTypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StandaloneDeriving" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "DeriveDataTypeable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AutoDeriveTypeable" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DeriveFunctor" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveTraversable" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "DeriveFoldable" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveGeneric" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DefaultSignatures" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DeriveAnyClass" 'PrefixI 'False) (U1 :: Type -> Type))))))) :+: (((((C1 ('MetaCons "DeriveLift" 'PrefixI 'False) (U1 :: Type -> Type) :+: (C1 ('MetaCons "DerivingStrategies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DerivingVia" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TypeSynonymInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FlexibleContexts" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "FlexibleInstances" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ConstrainedClassMethods" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "MultiParamTypeClasses" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NullaryTypeClasses" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "FunctionalDependencies" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "UnicodeSyntax" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "ExistentialQuantification" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MagicHash" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "EmptyDataDecls" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "KindSignatures" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "RoleAnnotations" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ParallelListComp" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TransformListComp" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MonadComprehensions" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "GeneralizedNewtypeDeriving" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "RecursiveDo" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PostfixOperators" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TupleSections" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "PatternGuards" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "LiberalTypeSynonyms" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "RankNTypes" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImpredicativeTypes" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "TypeOperators" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ExplicitNamespaces" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PackageImports" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ExplicitForAll" 'PrefixI 'False) (U1 :: Type -> Type)))))) :+: (((((C1 ('MetaCons "AlternativeLayoutRule" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "AlternativeLayoutRuleTransitional" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "DatatypeContexts" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NondecreasingIndentation" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "RelaxedLayout" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "TraditionalRecordSyntax" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "LambdaCase" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "MultiWayIf" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "BinaryLiterals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "NegativeLiterals" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "HexFloatLiterals" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "DuplicateRecordFields" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "OverloadedLabels" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "EmptyCase" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "PatternSynonyms" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "PartialTypeSignatures" 'PrefixI 'False) (U1 :: Type -> Type))))) :+: ((((C1 ('MetaCons "NamedWildCards" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StaticPointers" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "TypeApplications" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "Strict" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "StrictData" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "EmptyDataDeriving" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "NumericUnderscores" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "QuantifiedConstraints" 'PrefixI 'False) (U1 :: Type -> Type)))) :+: (((C1 ('MetaCons "StarIsType" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "ImportQualifiedPost" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "CUSKs" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "StandaloneKindSignatures" 'PrefixI 'False) (U1 :: Type -> Type))) :+: ((C1 ('MetaCons "LexicalNegation" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "FieldSelectors" 'PrefixI 'False) (U1 :: Type -> Type)) :+: (C1 ('MetaCons "OverloadedRecordDot" 'PrefixI 'False) (U1 :: Type -> Type) :+: C1 ('MetaCons "OverloadedRecordUpdate" 'PrefixI 'False) (U1 :: Type -> Type))))))))

type UniqFM = UniqFM

mkCgInteractiveGuts :: CgGuts -> CgGuts

justBytecode :: Linkable -> Maybe Linkable

justObjects :: Linkable -> Maybe Linkable

emptyHomeModInfoLinkable :: Maybe Linkable

homeModInfoByteCode :: HomeModInfo -> Maybe Linkable

homeModInfoObject :: HomeModInfo -> Maybe Linkable

field_label :: a -> a

groupOrigin :: MatchGroup p body -> Origin