ghc-6.12.3: The GHC APISource codeContentsIndex
StackColor
Synopsis
fold_edge_facts_b :: LastNode l => (DualLive -> a -> a) -> BackwardTransfers m l DualLive -> LGraph m l -> (BlockId -> DualLive) -> a -> a
foldConflicts :: (RegSet -> a -> a) -> a -> LGraph Middle Last -> FuelMonad a
type IGraph = Graph LocalReg SlotClass StackPlacement
type ClassCount = [(SlotClass, Int)]
buildIGraphAndCounts :: LGraph Middle Last -> FuelMonad (IGraph, ClassCount)
graphAddConflictSet :: RegSet -> IGraph -> IGraph
slotClass :: LocalReg -> SlotClass
mkSizeOf :: ClassCount -> SlotClass -> Int
Documentation
fold_edge_facts_b :: LastNode l => (DualLive -> a -> a) -> BackwardTransfers m l DualLive -> LGraph m l -> (BlockId -> DualLive) -> a -> aSource
foldConflicts :: (RegSet -> a -> a) -> a -> LGraph Middle Last -> FuelMonad aSource
type IGraph = Graph LocalReg SlotClass StackPlacementSource
type ClassCount = [(SlotClass, Int)]Source
buildIGraphAndCounts :: LGraph Middle Last -> FuelMonad (IGraph, ClassCount)Source
graphAddConflictSet :: RegSet -> IGraph -> IGraphSource
Add some conflict edges to the graph. Conflicts between virtual and real regs are recorded as exclusions.
slotClass :: LocalReg -> SlotClassSource
mkSizeOf :: ClassCount -> SlotClass -> IntSource
number of placements available is from class and all larger classes
Produced by Haddock version 2.6.1