Hoogle Search

Within LTS Haskell 24.50 (ghc-9.10.3)

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

  1. naturalLogBaseWord# :: Word# -> Natural -> Word#

    base GHC.Num

    No documentation available.

  2. naturalLt :: Natural -> Natural -> Bool

    base GHC.Num

    No documentation available.

  3. naturalLt# :: Natural -> Natural -> Bool#

    base GHC.Num

    No documentation available.

  4. CostCentresAll :: DoCostCentres

    base GHC.RTS.Flags

    No documentation available.

  5. block_alloc :: DebugFlags -> Bool

    base GHC.RTS.Flags

    b
    

  6. installSEHHandlers :: MiscFlags -> Bool

    base GHC.RTS.Flags

    No documentation available.

  7. installSignalHandlers :: MiscFlags -> Bool

    base GHC.RTS.Flags

    No documentation available.

  8. largeAllocLim :: GCFlags -> Word32

    base GHC.RTS.Flags

    No documentation available.

  9. minAllocAreaSize :: GCFlags -> Word32

    base GHC.RTS.Flags

    No documentation available.

  10. data CallStack

    base GHC.Stack

    CallStacks are a lightweight method of obtaining a partial call-stack at any point in the program. A function can request its call-site with the HasCallStack constraint. For example, we can define

    putStrLnWithCallStack :: HasCallStack => String -> IO ()
    
    as a variant of putStrLn that will get its call-site and print it, along with the string given as argument. We can access the call-stack inside putStrLnWithCallStack with callStack.
    >>> :{
    putStrLnWithCallStack :: HasCallStack => String -> IO ()
    putStrLnWithCallStack msg = do
    putStrLn msg
    putStrLn (prettyCallStack callStack)
    :}
    
    Thus, if we call putStrLnWithCallStack we will get a formatted call-stack alongside our string.
    >>> putStrLnWithCallStack "hello"
    hello
    CallStack (from HasCallStack):
    putStrLnWithCallStack, called at <interactive>:... in interactive:Ghci...
    
    GHC solves HasCallStack constraints in three steps:
    1. If there is a CallStack in scope -- i.e. the enclosing function has a HasCallStack constraint -- GHC will append the new call-site to the existing CallStack.
    2. If there is no CallStack in scope -- e.g. in the GHCi session above -- and the enclosing definition does not have an explicit type signature, GHC will infer a HasCallStack constraint for the enclosing definition (subject to the monomorphism restriction).
    3. If there is no CallStack in scope and the enclosing definition has an explicit type signature, GHC will solve the HasCallStack constraint for the singleton CallStack containing just the current call-site.
    CallStacks do not interact with the RTS and do not require compilation with -prof. On the other hand, as they are built up explicitly via the HasCallStack constraints, they will generally not contain as much information as the simulated call-stacks maintained by the RTS. A CallStack is a [(String, SrcLoc)]. The String is the name of function that was called, the SrcLoc is the call-site. The list is ordered with the most recently called function at the head. NOTE: The intrepid user may notice that HasCallStack is just an alias for an implicit parameter ?callStack :: CallStack. This is an implementation detail and should not be considered part of the CallStack API, we may decide to change the implementation in the future.

Page 190 of many | Previous | Next