{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE DisambiguateRecordFields #-}
{-# LANGUAGE GADTs #-}
{-# OPTIONS_GHC -Wno-incomplete-record-updates #-}
module GHC.Cmm.ProcPoint
( ProcPointSet, Status(..)
, callProcPoints, minimalProcPointSet
, splitAtProcPoints, procPointAnalysis
, attachContInfoTables
)
where
import GHC.Prelude hiding (last, unzip, succ, zip)
import GHC.Cmm.BlockId
import GHC.Cmm.CLabel
import GHC.Cmm
import GHC.Cmm.Ppr ()
import GHC.Cmm.Utils
import GHC.Cmm.Info
import GHC.Cmm.Liveness
import GHC.Cmm.Switch
import Data.List (sortBy)
import GHC.Data.Maybe
import Control.Monad
import GHC.Utils.Outputable
import GHC.Utils.Panic
import GHC.Platform
import GHC.Types.Unique.Supply
import GHC.Cmm.Dataflow.Block
import GHC.Cmm.Dataflow.Collections
import GHC.Cmm.Dataflow
import GHC.Cmm.Dataflow.Graph
import GHC.Cmm.Dataflow.Label
type ProcPointSet = LabelSet
data Status
= ReachedBy ProcPointSet
| ProcPoint
instance Outputable Status where
ppr :: Status -> SDoc
ppr (ReachedBy ProcPointSet
ps)
| forall set. IsSet set => set -> Bool
setNull ProcPointSet
ps = String -> SDoc
text String
"<not-reached>"
| Bool
otherwise = String -> SDoc
text String
"reached by" SDoc -> SDoc -> SDoc
<+>
([SDoc] -> SDoc
hsep forall a b. (a -> b) -> a -> b
$ SDoc -> [SDoc] -> [SDoc]
punctuate SDoc
comma forall a b. (a -> b) -> a -> b
$ forall a b. (a -> b) -> [a] -> [b]
map forall a. Outputable a => a -> SDoc
ppr forall a b. (a -> b) -> a -> b
$ forall set. IsSet set => set -> [ElemOf set]
setElems ProcPointSet
ps)
ppr Status
ProcPoint = String -> SDoc
text String
"<procpt>"
procPointAnalysis :: ProcPointSet -> CmmGraph -> LabelMap Status
procPointAnalysis :: ProcPointSet -> CmmGraph -> LabelMap Status
procPointAnalysis ProcPointSet
procPoints cmmGraph :: CmmGraph
cmmGraph@(CmmGraph {g_graph :: forall (n :: Extensibility -> Extensibility -> *).
GenCmmGraph n -> Graph n C C
g_graph = Graph CmmNode C C
graph}) =
forall f.
DataflowLattice f
-> TransferFun f -> CmmGraph -> FactBase f -> FactBase f
analyzeCmmFwd DataflowLattice Status
procPointLattice TransferFun Status
procPointTransfer CmmGraph
cmmGraph LabelMap Status
initProcPoints
where
initProcPoints :: LabelMap Status
initProcPoints =
forall f. DataflowLattice f -> [(BlockId, f)] -> FactBase f
mkFactBase
DataflowLattice Status
procPointLattice
[ (BlockId
id, Status
ProcPoint)
| BlockId
id <- forall set. IsSet set => set -> [ElemOf set]
setElems ProcPointSet
procPoints
, BlockId
id forall set. IsSet set => ElemOf set -> set -> Bool
`setMember` ProcPointSet
labelsInGraph
]
labelsInGraph :: ProcPointSet
labelsInGraph = forall (block :: (Extensibility -> Extensibility -> *)
-> Extensibility -> Extensibility -> *)
(n :: Extensibility -> Extensibility -> *) (e :: Extensibility)
(x :: Extensibility).
NonLocal (block n) =>
Graph' block n e x -> ProcPointSet
labelsDefined Graph CmmNode C C
graph
procPointTransfer :: TransferFun Status
procPointTransfer :: TransferFun Status
procPointTransfer Block CmmNode C C
block LabelMap Status
facts =
let label :: BlockId
label = forall (thing :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
NonLocal thing =>
thing C x -> BlockId
entryLabel Block CmmNode C C
block
!fact :: Status
fact = case forall f. DataflowLattice f -> BlockId -> FactBase f -> f
getFact DataflowLattice Status
procPointLattice BlockId
label LabelMap Status
facts of
Status
ProcPoint -> ProcPointSet -> Status
ReachedBy forall a b. (a -> b) -> a -> b
$! forall set. IsSet set => ElemOf set -> set
setSingleton BlockId
label
Status
f -> Status
f
result :: [(BlockId, Status)]
result = forall a b. (a -> b) -> [a] -> [b]
map (\BlockId
id -> (BlockId
id, Status
fact)) (forall (thing :: Extensibility -> Extensibility -> *)
(e :: Extensibility).
NonLocal thing =>
thing e C -> [BlockId]
successors Block CmmNode C C
block)
in forall f. DataflowLattice f -> [(BlockId, f)] -> FactBase f
mkFactBase DataflowLattice Status
procPointLattice [(BlockId, Status)]
result
procPointLattice :: DataflowLattice Status
procPointLattice :: DataflowLattice Status
procPointLattice = forall a. a -> JoinFun a -> DataflowLattice a
DataflowLattice Status
unreached OldFact Status -> NewFact Status -> JoinedFact Status
add_to
where
unreached :: Status
unreached = ProcPointSet -> Status
ReachedBy forall set. IsSet set => set
setEmpty
add_to :: OldFact Status -> NewFact Status -> JoinedFact Status
add_to (OldFact Status
ProcPoint) NewFact Status
_ = forall a. a -> JoinedFact a
NotChanged Status
ProcPoint
add_to OldFact Status
_ (NewFact Status
ProcPoint) = forall a. a -> JoinedFact a
Changed Status
ProcPoint
add_to (OldFact (ReachedBy ProcPointSet
p)) (NewFact (ReachedBy ProcPointSet
p'))
| forall set. IsSet set => set -> Int
setSize ProcPointSet
union forall a. Ord a => a -> a -> Bool
> forall set. IsSet set => set -> Int
setSize ProcPointSet
p = forall a. a -> JoinedFact a
Changed (ProcPointSet -> Status
ReachedBy ProcPointSet
union)
| Bool
otherwise = forall a. a -> JoinedFact a
NotChanged (ProcPointSet -> Status
ReachedBy ProcPointSet
p)
where
union :: ProcPointSet
union = forall set. IsSet set => set -> set -> set
setUnion ProcPointSet
p' ProcPointSet
p
callProcPoints :: CmmGraph -> ProcPointSet
callProcPoints :: CmmGraph -> ProcPointSet
callProcPoints CmmGraph
g = forall a. (a -> Block CmmNode C C -> a) -> a -> CmmGraph -> a
foldlGraphBlocks ProcPointSet -> Block CmmNode C C -> ProcPointSet
add (forall set. IsSet set => ElemOf set -> set
setSingleton (forall (n :: Extensibility -> Extensibility -> *).
GenCmmGraph n -> BlockId
g_entry CmmGraph
g)) CmmGraph
g
where add :: LabelSet -> CmmBlock -> LabelSet
add :: ProcPointSet -> Block CmmNode C C -> ProcPointSet
add ProcPointSet
set Block CmmNode C C
b = case forall (n :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
Block n x C -> n O C
lastNode Block CmmNode C C
b of
CmmCall {cml_cont :: CmmNode O C -> Maybe BlockId
cml_cont = Just BlockId
k} -> forall set. IsSet set => ElemOf set -> set -> set
setInsert BlockId
k ProcPointSet
set
CmmForeignCall {succ :: CmmNode O C -> BlockId
succ=BlockId
k} -> forall set. IsSet set => ElemOf set -> set -> set
setInsert BlockId
k ProcPointSet
set
CmmNode O C
_ -> ProcPointSet
set
minimalProcPointSet :: Platform -> ProcPointSet -> CmmGraph
-> UniqSM ProcPointSet
minimalProcPointSet :: Platform -> ProcPointSet -> CmmGraph -> UniqSM ProcPointSet
minimalProcPointSet Platform
platform ProcPointSet
callProcPoints CmmGraph
g
= Platform
-> CmmGraph
-> [Block CmmNode C C]
-> ProcPointSet
-> UniqSM ProcPointSet
extendPPSet Platform
platform CmmGraph
g (CmmGraph -> [Block CmmNode C C]
revPostorder CmmGraph
g) ProcPointSet
callProcPoints
extendPPSet
:: Platform -> CmmGraph -> [CmmBlock] -> ProcPointSet -> UniqSM ProcPointSet
extendPPSet :: Platform
-> CmmGraph
-> [Block CmmNode C C]
-> ProcPointSet
-> UniqSM ProcPointSet
extendPPSet Platform
platform CmmGraph
g [Block CmmNode C C]
blocks ProcPointSet
procPoints =
let env :: LabelMap Status
env = ProcPointSet -> CmmGraph -> LabelMap Status
procPointAnalysis ProcPointSet
procPoints CmmGraph
g
add :: ProcPointSet -> Block CmmNode C C -> ProcPointSet
add ProcPointSet
pps Block CmmNode C C
block = let id :: BlockId
id = forall (thing :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
NonLocal thing =>
thing C x -> BlockId
entryLabel Block CmmNode C C
block
in case forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
id LabelMap Status
env of
Just Status
ProcPoint -> forall set. IsSet set => ElemOf set -> set -> set
setInsert BlockId
id ProcPointSet
pps
Maybe Status
_ -> ProcPointSet
pps
procPoints' :: ProcPointSet
procPoints' = forall a. (a -> Block CmmNode C C -> a) -> a -> CmmGraph -> a
foldlGraphBlocks ProcPointSet -> Block CmmNode C C -> ProcPointSet
add forall set. IsSet set => set
setEmpty CmmGraph
g
newPoints :: [BlockId]
newPoints = forall a b. (a -> Maybe b) -> [a] -> [b]
mapMaybe Block CmmNode C C -> Maybe BlockId
ppSuccessor [Block CmmNode C C]
blocks
newPoint :: Maybe BlockId
newPoint = forall a. [a] -> Maybe a
listToMaybe [BlockId]
newPoints
ppSuccessor :: Block CmmNode C C -> Maybe BlockId
ppSuccessor Block CmmNode C C
b =
let nreached :: BlockId -> Int
nreached BlockId
id = case forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
id LabelMap Status
env forall a. Maybe a -> a -> a
`orElse`
forall a. HasCallStack => String -> SDoc -> a
pprPanic String
"no ppt" (forall a. Outputable a => a -> SDoc
ppr BlockId
id SDoc -> SDoc -> SDoc
<+> forall env a. OutputableP env a => env -> a -> SDoc
pdoc Platform
platform Block CmmNode C C
b) of
Status
ProcPoint -> Int
1
ReachedBy ProcPointSet
ps -> forall set. IsSet set => set -> Int
setSize ProcPointSet
ps
block_procpoints :: Int
block_procpoints = BlockId -> Int
nreached (forall (thing :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
NonLocal thing =>
thing C x -> BlockId
entryLabel Block CmmNode C C
b)
newId :: BlockId -> Bool
newId BlockId
succ_id = Bool -> Bool
not (forall set. IsSet set => ElemOf set -> set -> Bool
setMember BlockId
succ_id ProcPointSet
procPoints') Bool -> Bool -> Bool
&&
BlockId -> Int
nreached BlockId
succ_id forall a. Ord a => a -> a -> Bool
> Int
block_procpoints
in forall a. [a] -> Maybe a
listToMaybe forall a b. (a -> b) -> a -> b
$ forall a. (a -> Bool) -> [a] -> [a]
filter BlockId -> Bool
newId forall a b. (a -> b) -> a -> b
$ forall (thing :: Extensibility -> Extensibility -> *)
(e :: Extensibility).
NonLocal thing =>
thing e C -> [BlockId]
successors Block CmmNode C C
b
in case Maybe BlockId
newPoint of
Just BlockId
id ->
if forall set. IsSet set => ElemOf set -> set -> Bool
setMember BlockId
id ProcPointSet
procPoints'
then forall a. String -> a
panic String
"added old proc pt"
else Platform
-> CmmGraph
-> [Block CmmNode C C]
-> ProcPointSet
-> UniqSM ProcPointSet
extendPPSet Platform
platform CmmGraph
g [Block CmmNode C C]
blocks (forall set. IsSet set => ElemOf set -> set -> set
setInsert BlockId
id ProcPointSet
procPoints')
Maybe BlockId
Nothing -> forall (m :: * -> *) a. Monad m => a -> m a
return ProcPointSet
procPoints'
splitAtProcPoints :: Platform -> CLabel -> ProcPointSet-> ProcPointSet -> LabelMap Status -> CmmDecl
-> UniqSM [CmmDecl]
splitAtProcPoints :: Platform
-> CLabel
-> ProcPointSet
-> ProcPointSet
-> LabelMap Status
-> CmmDecl
-> UniqSM [CmmDecl]
splitAtProcPoints Platform
_ CLabel
_ ProcPointSet
_ ProcPointSet
_ LabelMap Status
_ t :: CmmDecl
t@(CmmData Section
_ CmmStatics
_) = forall (m :: * -> *) a. Monad m => a -> m a
return [CmmDecl
t]
splitAtProcPoints Platform
platform CLabel
entry_label ProcPointSet
callPPs ProcPointSet
procPoints LabelMap Status
procMap CmmDecl
cmmProc = do
let (CmmProc (TopInfo {info_tbls :: CmmTopInfo -> LabelMap CmmInfoTable
info_tbls = LabelMap CmmInfoTable
info_tbls}) CLabel
top_l [GlobalReg]
_ g :: CmmGraph
g@(CmmGraph {g_entry :: forall (n :: Extensibility -> Extensibility -> *).
GenCmmGraph n -> BlockId
g_entry=BlockId
entry})) = CmmDecl
cmmProc
let add :: map (map a) -> KeyOf map -> KeyOf map -> a -> map (map a)
add map (map a)
graphEnv KeyOf map
procId KeyOf map
bid a
b = forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> a -> map a -> map a
mapInsert KeyOf map
procId map a
graph' map (map a)
graphEnv
where
graph' :: map a
graph' = forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> a -> map a -> map a
mapInsert KeyOf map
bid a
b map a
graph
graph :: map a
graph = forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup KeyOf map
procId map (map a)
graphEnv forall a. Maybe a -> a -> a
`orElse` forall (map :: * -> *) a. IsMap map => map a
mapEmpty
let add_block :: LabelMap (LabelMap CmmBlock) -> CmmBlock -> LabelMap (LabelMap CmmBlock)
add_block :: LabelMap (LabelMap (Block CmmNode C C))
-> Block CmmNode C C -> LabelMap (LabelMap (Block CmmNode C C))
add_block LabelMap (LabelMap (Block CmmNode C C))
graphEnv Block CmmNode C C
b =
case forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
bid LabelMap Status
procMap of
Just Status
ProcPoint -> forall {map :: * -> *} {map :: * -> *} {a}.
(IsMap map, IsMap map) =>
map (map a) -> KeyOf map -> KeyOf map -> a -> map (map a)
add LabelMap (LabelMap (Block CmmNode C C))
graphEnv BlockId
bid BlockId
bid Block CmmNode C C
b
Just (ReachedBy ProcPointSet
set) ->
case forall set. IsSet set => set -> [ElemOf set]
setElems ProcPointSet
set of
[] -> LabelMap (LabelMap (Block CmmNode C C))
graphEnv
[ElemOf ProcPointSet
id] -> forall {map :: * -> *} {map :: * -> *} {a}.
(IsMap map, IsMap map) =>
map (map a) -> KeyOf map -> KeyOf map -> a -> map (map a)
add LabelMap (LabelMap (Block CmmNode C C))
graphEnv ElemOf ProcPointSet
id BlockId
bid Block CmmNode C C
b
[ElemOf ProcPointSet]
_ -> forall a. String -> a
panic String
"Each block should be reachable from only one ProcPoint"
Maybe Status
Nothing -> LabelMap (LabelMap (Block CmmNode C C))
graphEnv
where
bid :: BlockId
bid = forall (thing :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
NonLocal thing =>
thing C x -> BlockId
entryLabel Block CmmNode C C
b
let liveness :: BlockEntryLiveness GlobalReg
liveness = Platform -> CmmGraph -> BlockEntryLiveness GlobalReg
cmmGlobalLiveness Platform
platform CmmGraph
g
let ppLiveness :: BlockId -> [GlobalReg]
ppLiveness BlockId
pp = forall a. (a -> Bool) -> [a] -> [a]
filter GlobalReg -> Bool
isArgReg forall a b. (a -> b) -> a -> b
$ forall r. RegSet r -> [r]
regSetToList forall a b. (a -> b) -> a -> b
$
forall a. HasCallStack => String -> Maybe a -> a
expectJust String
"ppLiveness" forall a b. (a -> b) -> a -> b
$ forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
pp BlockEntryLiveness GlobalReg
liveness
LabelMap (LabelMap (Block CmmNode C C))
graphEnv <- forall (m :: * -> *) a. Monad m => a -> m a
return forall a b. (a -> b) -> a -> b
$ forall a. (a -> Block CmmNode C C -> a) -> a -> CmmGraph -> a
foldlGraphBlocks LabelMap (LabelMap (Block CmmNode C C))
-> Block CmmNode C C -> LabelMap (LabelMap (Block CmmNode C C))
add_block forall (map :: * -> *) a. IsMap map => map a
mapEmpty CmmGraph
g
let add_label :: LabelMap (CLabel, Maybe CLabel)
-> BlockId -> LabelMap (CLabel, Maybe CLabel)
add_label LabelMap (CLabel, Maybe CLabel)
map BlockId
pp = forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> a -> map a -> map a
mapInsert BlockId
pp (CLabel, Maybe CLabel)
lbls LabelMap (CLabel, Maybe CLabel)
map
where lbls :: (CLabel, Maybe CLabel)
lbls | BlockId
pp forall a. Eq a => a -> a -> Bool
== BlockId
entry = (CLabel
entry_label, forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap CmmInfoTable -> CLabel
cit_lbl (forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
entry LabelMap CmmInfoTable
info_tbls))
| Bool
otherwise = (CLabel
block_lbl, forall (f :: * -> *). Alternative f => Bool -> f ()
guard (forall set. IsSet set => ElemOf set -> set -> Bool
setMember BlockId
pp ProcPointSet
callPPs) forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>>
forall a. a -> Maybe a
Just CLabel
info_table_lbl)
where block_lbl :: CLabel
block_lbl = BlockId -> CLabel
blockLbl BlockId
pp
info_table_lbl :: CLabel
info_table_lbl = BlockId -> CLabel
infoTblLbl BlockId
pp
procLabels :: LabelMap (CLabel, Maybe CLabel)
procLabels :: LabelMap (CLabel, Maybe CLabel)
procLabels = forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl' LabelMap (CLabel, Maybe CLabel)
-> BlockId -> LabelMap (CLabel, Maybe CLabel)
add_label forall (map :: * -> *) a. IsMap map => map a
mapEmpty
(forall a. (a -> Bool) -> [a] -> [a]
filter (forall a b c. (a -> b -> c) -> b -> a -> c
flip forall (map :: * -> *) a. IsMap map => KeyOf map -> map a -> Bool
mapMember (CmmGraph -> LabelMap (Block CmmNode C C)
toBlockMap CmmGraph
g)) (forall set. IsSet set => set -> [ElemOf set]
setElems ProcPointSet
procPoints))
let add_jump_block :: (LabelMap Label, [CmmBlock])
-> (Label, CLabel)
-> UniqSM (LabelMap Label, [CmmBlock])
add_jump_block :: (LabelMap BlockId, [Block CmmNode C C])
-> (BlockId, CLabel)
-> UniqSM (LabelMap BlockId, [Block CmmNode C C])
add_jump_block (LabelMap BlockId
env, [Block CmmNode C C]
bs) (BlockId
pp, CLabel
l) = do
BlockId
bid <- forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM Unique -> BlockId
mkBlockId forall (m :: * -> *). MonadUnique m => m Unique
getUniqueM
let b :: Block CmmNode C C
b = forall (n :: Extensibility -> Extensibility -> *).
n C O -> Block n O O -> n O C -> Block n C C
blockJoin (BlockId -> CmmTickScope -> CmmNode C O
CmmEntry BlockId
bid CmmTickScope
GlobalScope) forall (n :: Extensibility -> Extensibility -> *). Block n O O
emptyBlock CmmNode O C
jump
live :: [GlobalReg]
live = BlockId -> [GlobalReg]
ppLiveness BlockId
pp
jump :: CmmNode O C
jump = CmmExpr
-> Maybe BlockId -> [GlobalReg] -> Int -> Int -> Int -> CmmNode O C
CmmCall (CmmLit -> CmmExpr
CmmLit (CLabel -> CmmLit
CmmLabel CLabel
l)) forall a. Maybe a
Nothing [GlobalReg]
live Int
0 Int
0 Int
0
forall (m :: * -> *) a. Monad m => a -> m a
return (forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> a -> map a -> map a
mapInsert BlockId
pp BlockId
bid LabelMap BlockId
env, Block CmmNode C C
b forall a. a -> [a] -> [a]
: [Block CmmNode C C]
bs)
let tablesNextToCode :: Bool
tablesNextToCode = Platform -> Bool
platformTablesNextToCode Platform
platform
let jump_label :: Maybe CLabel -> CLabel -> CLabel
jump_label (Just CLabel
info_lbl) CLabel
_
| Bool
tablesNextToCode = CLabel
info_lbl
| Bool
otherwise = Platform -> CLabel -> CLabel
toEntryLbl Platform
platform CLabel
info_lbl
jump_label Maybe CLabel
Nothing CLabel
block_lbl = CLabel
block_lbl
let add_if_pp :: BlockId -> [(BlockId, CLabel)] -> [(BlockId, CLabel)]
add_if_pp BlockId
id [(BlockId, CLabel)]
rst =
case forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
id LabelMap (CLabel, Maybe CLabel)
procLabels of
Just (CLabel
lbl, Maybe CLabel
mb_info_lbl) -> (BlockId
id, Maybe CLabel -> CLabel -> CLabel
jump_label Maybe CLabel
mb_info_lbl CLabel
lbl) forall a. a -> [a] -> [a]
: [(BlockId, CLabel)]
rst
Maybe (CLabel, Maybe CLabel)
Nothing -> [(BlockId, CLabel)]
rst
let add_if_branch_to_pp :: CmmBlock -> [(BlockId, CLabel)] -> [(BlockId, CLabel)]
add_if_branch_to_pp :: Block CmmNode C C -> [(BlockId, CLabel)] -> [(BlockId, CLabel)]
add_if_branch_to_pp Block CmmNode C C
block [(BlockId, CLabel)]
rst =
case forall (n :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
Block n x C -> n O C
lastNode Block CmmNode C C
block of
CmmBranch BlockId
id -> BlockId -> [(BlockId, CLabel)] -> [(BlockId, CLabel)]
add_if_pp BlockId
id [(BlockId, CLabel)]
rst
CmmCondBranch CmmExpr
_ BlockId
ti BlockId
fi Maybe Bool
_ -> BlockId -> [(BlockId, CLabel)] -> [(BlockId, CLabel)]
add_if_pp BlockId
ti (BlockId -> [(BlockId, CLabel)] -> [(BlockId, CLabel)]
add_if_pp BlockId
fi [(BlockId, CLabel)]
rst)
CmmSwitch CmmExpr
_ SwitchTargets
ids -> forall (t :: * -> *) a b.
Foldable t =>
(a -> b -> b) -> b -> t a -> b
foldr BlockId -> [(BlockId, CLabel)] -> [(BlockId, CLabel)]
add_if_pp [(BlockId, CLabel)]
rst forall a b. (a -> b) -> a -> b
$ SwitchTargets -> [BlockId]
switchTargetsToList SwitchTargets
ids
CmmNode O C
_ -> [(BlockId, CLabel)]
rst
let add_jumps :: LabelMap CmmGraph -> (Label, LabelMap CmmBlock) -> UniqSM (LabelMap CmmGraph)
add_jumps :: LabelMap CmmGraph
-> (BlockId, LabelMap (Block CmmNode C C))
-> UniqSM (LabelMap CmmGraph)
add_jumps LabelMap CmmGraph
newGraphEnv (BlockId
ppId, LabelMap (Block CmmNode C C)
blockEnv) = do
let needed_jumps :: [(BlockId, CLabel)]
needed_jumps = forall (map :: * -> *) a b.
IsMap map =>
(a -> b -> b) -> b -> map a -> b
mapFoldr Block CmmNode C C -> [(BlockId, CLabel)] -> [(BlockId, CLabel)]
add_if_branch_to_pp [] LabelMap (Block CmmNode C C)
blockEnv
(LabelMap BlockId
jumpEnv, [Block CmmNode C C]
jumpBlocks) <-
forall (t :: * -> *) (m :: * -> *) b a.
(Foldable t, Monad m) =>
(b -> a -> m b) -> b -> t a -> m b
foldM (LabelMap BlockId, [Block CmmNode C C])
-> (BlockId, CLabel)
-> UniqSM (LabelMap BlockId, [Block CmmNode C C])
add_jump_block (forall (map :: * -> *) a. IsMap map => map a
mapEmpty, []) [(BlockId, CLabel)]
needed_jumps
let b :: Block CmmNode C C
b = forall a. HasCallStack => String -> Maybe a -> a
expectJust String
"block in env" forall a b. (a -> b) -> a -> b
$ forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
ppId LabelMap (Block CmmNode C C)
blockEnv
blockEnv' :: LabelMap (Block CmmNode C C)
blockEnv' = forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> a -> map a -> map a
mapInsert BlockId
ppId Block CmmNode C C
b LabelMap (Block CmmNode C C)
blockEnv
blockEnv'' :: LabelMap (Block CmmNode C C)
blockEnv'' = CmmGraph -> LabelMap (Block CmmNode C C)
toBlockMap forall a b. (a -> b) -> a -> b
$ LabelMap BlockId -> CmmGraph -> CmmGraph
replaceBranches LabelMap BlockId
jumpEnv forall a b. (a -> b) -> a -> b
$ BlockId -> LabelMap (Block CmmNode C C) -> CmmGraph
ofBlockMap BlockId
ppId LabelMap (Block CmmNode C C)
blockEnv'
blockEnv''' :: LabelMap (Block CmmNode C C)
blockEnv''' = forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl' (forall a b c. (a -> b -> c) -> b -> a -> c
flip forall (block :: Extensibility -> Extensibility -> *).
(NonLocal block, HasDebugCallStack) =>
block C C -> LabelMap (block C C) -> LabelMap (block C C)
addBlock) LabelMap (Block CmmNode C C)
blockEnv'' [Block CmmNode C C]
jumpBlocks
let g' :: CmmGraph
g' = BlockId -> LabelMap (Block CmmNode C C) -> CmmGraph
ofBlockMap BlockId
ppId LabelMap (Block CmmNode C C)
blockEnv'''
forall (m :: * -> *) a. Monad m => a -> m a
return (forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> a -> map a -> map a
mapInsert BlockId
ppId CmmGraph
g' LabelMap CmmGraph
newGraphEnv)
LabelMap CmmGraph
graphEnv <- forall (t :: * -> *) (m :: * -> *) b a.
(Foldable t, Monad m) =>
(b -> a -> m b) -> b -> t a -> m b
foldM LabelMap CmmGraph
-> (BlockId, LabelMap (Block CmmNode C C))
-> UniqSM (LabelMap CmmGraph)
add_jumps forall (map :: * -> *) a. IsMap map => map a
mapEmpty forall a b. (a -> b) -> a -> b
$ forall (map :: * -> *) a. IsMap map => map a -> [(KeyOf map, a)]
mapToList LabelMap (LabelMap (Block CmmNode C C))
graphEnv
let to_proc :: (BlockId, CmmGraph) -> CmmDecl
to_proc (BlockId
bid, CmmGraph
g)
| BlockId
bid forall a. Eq a => a -> a -> Bool
== BlockId
entry
= forall d h g. h -> CLabel -> [GlobalReg] -> g -> GenCmmDecl d h g
CmmProc (TopInfo {info_tbls :: LabelMap CmmInfoTable
info_tbls = LabelMap CmmInfoTable
info_tbls,
stack_info :: CmmStackInfo
stack_info = CmmStackInfo
stack_info})
CLabel
top_l [GlobalReg]
live CmmGraph
g'
| Bool
otherwise
= case forall a. HasCallStack => String -> Maybe a -> a
expectJust String
"pp label" forall a b. (a -> b) -> a -> b
$ forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
bid LabelMap (CLabel, Maybe CLabel)
procLabels of
(CLabel
lbl, Just CLabel
info_lbl)
-> forall d h g. h -> CLabel -> [GlobalReg] -> g -> GenCmmDecl d h g
CmmProc (TopInfo { info_tbls :: LabelMap CmmInfoTable
info_tbls = forall (map :: * -> *) a. IsMap map => KeyOf map -> a -> map a
mapSingleton (forall (n :: Extensibility -> Extensibility -> *).
GenCmmGraph n -> BlockId
g_entry CmmGraph
g) (CLabel -> CmmInfoTable
mkEmptyContInfoTable CLabel
info_lbl)
, stack_info :: CmmStackInfo
stack_info=CmmStackInfo
stack_info})
CLabel
lbl [GlobalReg]
live CmmGraph
g'
(CLabel
lbl, Maybe CLabel
Nothing)
-> forall d h g. h -> CLabel -> [GlobalReg] -> g -> GenCmmDecl d h g
CmmProc (TopInfo {info_tbls :: LabelMap CmmInfoTable
info_tbls = forall (map :: * -> *) a. IsMap map => map a
mapEmpty, stack_info :: CmmStackInfo
stack_info=CmmStackInfo
stack_info})
CLabel
lbl [GlobalReg]
live CmmGraph
g'
where
g' :: CmmGraph
g' = CmmGraph -> CmmGraph
replacePPIds CmmGraph
g
live :: [GlobalReg]
live = BlockId -> [GlobalReg]
ppLiveness (forall (n :: Extensibility -> Extensibility -> *).
GenCmmGraph n -> BlockId
g_entry CmmGraph
g')
stack_info :: CmmStackInfo
stack_info = StackInfo { arg_space :: Int
arg_space = Int
0
, do_layout :: Bool
do_layout = Bool
True }
replacePPIds :: CmmGraph -> CmmGraph
replacePPIds CmmGraph
g = {-# SCC "replacePPIds" #-}
(CmmNode C O -> CmmNode C O, CmmNode O O -> CmmNode O O,
CmmNode O C -> CmmNode O C)
-> CmmGraph -> CmmGraph
mapGraphNodes (forall a. a -> a
id, forall (e :: Extensibility) (x :: Extensibility).
(CmmExpr -> CmmExpr) -> CmmNode e x -> CmmNode e x
mapExp CmmExpr -> CmmExpr
repl, forall (e :: Extensibility) (x :: Extensibility).
(CmmExpr -> CmmExpr) -> CmmNode e x -> CmmNode e x
mapExp CmmExpr -> CmmExpr
repl) CmmGraph
g
where repl :: CmmExpr -> CmmExpr
repl e :: CmmExpr
e@(CmmLit (CmmBlock BlockId
bid)) =
case forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
bid LabelMap (CLabel, Maybe CLabel)
procLabels of
Just (CLabel
_, Just CLabel
info_lbl) -> CmmLit -> CmmExpr
CmmLit (CLabel -> CmmLit
CmmLabel CLabel
info_lbl)
Maybe (CLabel, Maybe CLabel)
_ -> CmmExpr
e
repl CmmExpr
e = CmmExpr
e
let add_block_num :: (a, map a) -> thing C x -> (a, map a)
add_block_num (a
i, map a
map) thing C x
block =
(a
i forall a. Num a => a -> a -> a
+ a
1, forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> a -> map a -> map a
mapInsert (forall (thing :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
NonLocal thing =>
thing C x -> BlockId
entryLabel thing C x
block) a
i map a
map)
let (Int
_, LabelMap Int
block_order) =
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl' forall {map :: * -> *} {a}
{thing :: Extensibility -> Extensibility -> *}
{x :: Extensibility}.
(KeyOf map ~ BlockId, Num a, IsMap map, NonLocal thing) =>
(a, map a) -> thing C x -> (a, map a)
add_block_num (Int
0::Int, forall (map :: * -> *) a. IsMap map => map a
mapEmpty :: LabelMap Int)
(CmmGraph -> [Block CmmNode C C]
revPostorder CmmGraph
g)
let sort_fn :: (BlockId, CmmGraph) -> (BlockId, CmmGraph) -> Ordering
sort_fn (BlockId
bid, CmmGraph
_) (BlockId
bid', CmmGraph
_) =
forall a. Ord a => a -> a -> Ordering
compare (forall a. HasCallStack => String -> Maybe a -> a
expectJust String
"block_order" forall a b. (a -> b) -> a -> b
$ forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
bid LabelMap Int
block_order)
(forall a. HasCallStack => String -> Maybe a -> a
expectJust String
"block_order" forall a b. (a -> b) -> a -> b
$ forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
bid' LabelMap Int
block_order)
forall (m :: * -> *) a. Monad m => a -> m a
return forall a b. (a -> b) -> a -> b
$ forall a b. (a -> b) -> [a] -> [b]
map (BlockId, CmmGraph) -> CmmDecl
to_proc forall a b. (a -> b) -> a -> b
$ forall a. (a -> a -> Ordering) -> [a] -> [a]
sortBy (BlockId, CmmGraph) -> (BlockId, CmmGraph) -> Ordering
sort_fn forall a b. (a -> b) -> a -> b
$ forall (map :: * -> *) a. IsMap map => map a -> [(KeyOf map, a)]
mapToList LabelMap CmmGraph
graphEnv
replaceBranches :: LabelMap BlockId -> CmmGraph -> CmmGraph
replaceBranches :: LabelMap BlockId -> CmmGraph -> CmmGraph
replaceBranches LabelMap BlockId
env CmmGraph
cmmg
= {-# SCC "replaceBranches" #-}
BlockId -> LabelMap (Block CmmNode C C) -> CmmGraph
ofBlockMap (forall (n :: Extensibility -> Extensibility -> *).
GenCmmGraph n -> BlockId
g_entry CmmGraph
cmmg) forall a b. (a -> b) -> a -> b
$ forall (map :: * -> *) a b. IsMap map => (a -> b) -> map a -> map b
mapMap forall {x :: Extensibility}. Block CmmNode x C -> Block CmmNode x C
f forall a b. (a -> b) -> a -> b
$ CmmGraph -> LabelMap (Block CmmNode C C)
toBlockMap CmmGraph
cmmg
where
f :: Block CmmNode x C -> Block CmmNode x C
f Block CmmNode x C
block = forall (n :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
Block n x C -> n O C -> Block n x C
replaceLastNode Block CmmNode x C
block forall a b. (a -> b) -> a -> b
$ CmmNode O C -> CmmNode O C
last (forall (n :: Extensibility -> Extensibility -> *)
(x :: Extensibility).
Block n x C -> n O C
lastNode Block CmmNode x C
block)
last :: CmmNode O C -> CmmNode O C
last :: CmmNode O C -> CmmNode O C
last (CmmBranch BlockId
id) = BlockId -> CmmNode O C
CmmBranch (BlockId -> BlockId
lookup BlockId
id)
last (CmmCondBranch CmmExpr
e BlockId
ti BlockId
fi Maybe Bool
l) = CmmExpr -> BlockId -> BlockId -> Maybe Bool -> CmmNode O C
CmmCondBranch CmmExpr
e (BlockId -> BlockId
lookup BlockId
ti) (BlockId -> BlockId
lookup BlockId
fi) Maybe Bool
l
last (CmmSwitch CmmExpr
e SwitchTargets
ids) = CmmExpr -> SwitchTargets -> CmmNode O C
CmmSwitch CmmExpr
e ((BlockId -> BlockId) -> SwitchTargets -> SwitchTargets
mapSwitchTargets BlockId -> BlockId
lookup SwitchTargets
ids)
last l :: CmmNode O C
l@(CmmCall {}) = CmmNode O C
l { cml_cont :: Maybe BlockId
cml_cont = forall a. Maybe a
Nothing }
last l :: CmmNode O C
l@(CmmForeignCall {}) = CmmNode O C
l
lookup :: BlockId -> BlockId
lookup BlockId
id = forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap BlockId -> BlockId
lookup (forall (map :: * -> *) a.
IsMap map =>
KeyOf map -> map a -> Maybe a
mapLookup BlockId
id LabelMap BlockId
env) forall a. Maybe a -> a -> a
`orElse` BlockId
id
attachContInfoTables :: ProcPointSet -> CmmDecl -> CmmDecl
attachContInfoTables :: ProcPointSet -> CmmDecl -> CmmDecl
attachContInfoTables ProcPointSet
call_proc_points (CmmProc CmmTopInfo
top_info CLabel
top_l [GlobalReg]
live CmmGraph
g)
= forall d h g. h -> CLabel -> [GlobalReg] -> g -> GenCmmDecl d h g
CmmProc CmmTopInfo
top_info{info_tbls :: LabelMap CmmInfoTable
info_tbls = LabelMap CmmInfoTable
info_tbls'} CLabel
top_l [GlobalReg]
live CmmGraph
g
where
info_tbls' :: LabelMap CmmInfoTable
info_tbls' = forall (map :: * -> *) a. IsMap map => map a -> map a -> map a
mapUnion (CmmTopInfo -> LabelMap CmmInfoTable
info_tbls CmmTopInfo
top_info) forall a b. (a -> b) -> a -> b
$
forall (map :: * -> *) a. IsMap map => [(KeyOf map, a)] -> map a
mapFromList [ (BlockId
l, CLabel -> CmmInfoTable
mkEmptyContInfoTable (BlockId -> CLabel
infoTblLbl BlockId
l))
| BlockId
l <- forall set. IsSet set => set -> [ElemOf set]
setElems ProcPointSet
call_proc_points
, BlockId
l forall a. Eq a => a -> a -> Bool
/= forall (n :: Extensibility -> Extensibility -> *).
GenCmmGraph n -> BlockId
g_entry CmmGraph
g ]
attachContInfoTables ProcPointSet
_ CmmDecl
other_decl
= CmmDecl
other_decl