Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

  1. allocateReg :: RealReg -> FreeRegs -> FreeRegs

    ghc GHC.CmmToAsm.Reg.Linear.X86_64

    No documentation available.

  2. allocMoreStack :: Platform -> Int -> NatCmmDecl statics Instr -> UniqSM (NatCmmDecl statics Instr, [(BlockId, BlockId)])

    ghc GHC.CmmToAsm.X86.Instr

    No documentation available.

  3. allArgRegs :: Platform -> [(Reg, Reg)]

    ghc GHC.CmmToAsm.X86.Regs

    No documentation available.

  4. allFPArgRegs :: Platform -> [Reg]

    ghc GHC.CmmToAsm.X86.Regs

    on 64bit platforms we pass the first 8 float/double arguments in the xmm registers.

  5. allIntArgRegs :: Platform -> [Reg]

    ghc GHC.CmmToAsm.X86.Regs

    No documentation available.

  6. allMachRegNos :: Platform -> [RegNo]

    ghc GHC.CmmToAsm.X86.Regs

    The complete set of machine registers.

  7. allocatableRegs :: Platform -> [RealReg]

    ghc GHC.CmmToAsm.X86.Regs

    No documentation available.

  8. allBag :: (a -> Bool) -> Bag a -> Bool

    ghc GHC.Data.Bag

    No documentation available.

  9. allReachable :: Ord key => Graph node -> (node -> key) -> Map key (Set key)

    ghc GHC.Data.Graph.Directed

    Efficiently construct a map which maps each key to it's set of transitive dependencies. Only works on acyclic input.

  10. allReachableCyclic :: Ord key => Graph node -> (node -> key) -> Map key (Set key)

    ghc GHC.Data.Graph.Directed

    Efficiently construct a map which maps each key to it's set of transitive dependencies. Less efficient than allReachable, but works on cyclic input as well.

Page 82 of many | Previous | Next