Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. getFirst :: First a -> Maybe a

   base-compat	Data.Monoid.Compat

   No documentation available.

2. getFirst :: First a -> a

   base-compat	Data.Semigroup.Compat

   No documentation available.

3. GlobalPackageDBSpecifiedFirst :: CabalException

   Cabal	Distribution.Simple.Errors

   No documentation available.

4. GlobalPackageDbSpecifiedFirst :: CabalException

   Cabal	Distribution.Simple.Errors

   No documentation available.

5. findFirstFile :: (a -> FilePath) -> [a] -> IO (Maybe a)

   Cabal	Distribution.Simple.Utils

   No documentation available.

6. CompactGetFirstBlockOp :: PrimOp

   ghc	GHC.Builtin.PrimOps

   No documentation available.

7. replaceFirstNode :: forall n (x :: Extensibility) . Block n C x -> n C O -> Block n C x

   ghc	GHC.Cmm.Dataflow.Block

   No documentation available.

8. toBlockListEntryFirst :: CmmGraph -> [CmmBlock]

   ghc	GHC.Cmm.Utils

   like toBlockList, but the entry block always comes first

9. toBlockListEntryFirstFalseFallthrough :: CmmGraph -> [CmmBlock]

   ghc	GHC.Cmm.Utils

   Like toBlockListEntryFirst, but we strive to ensure that we order blocks so that the false case of a conditional jumps to the next block in the output list of blocks. This matches the way OldCmm blocks were output since in OldCmm the false case was a fallthrough, whereas in Cmm conditional branches have both true and false successors. Block ordering can make a big difference in performance in the LLVM backend. Note that we rely crucially on the order of successors returned for CmmCondBranch by the NonLocal instance for CmmNode defined in GHC.Cmm.Node. -GBM

10. lookupFirstUsed :: VirtualReg -> BlockAssignment freeRegs -> Maybe RealReg

    ghc	GHC.CmmToAsm.Reg.Linear.Base

    Lookup which register a virtual register was first assigned to.

Page 38 of many | Previous | Next