CmmContFlowOpt.hs 8.33 KB
Newer Older
1

2 3
module CmmContFlowOpt
    ( runCmmOpts, cmmCfgOpts, cmmCfgOptsZ
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
4
    , branchChainElimZ, removeUnreachableBlocksZ, predMap
5
    , replaceLabelsZ, replaceBranches, runCmmContFlowOptsZs
6 7 8
    )
where

9
import BlockId
10 11 12
import Cmm
import CmmTx
import qualified ZipCfg as G
13
import ZipCfg
14
import ZipCfgCmmRep
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
15

16
import Maybes
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
17
import Monad
18
import Outputable
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
19
import Prelude hiding (unzip, zip)
20 21 22
import Util

------------------------------------
23 24 25 26
runCmmContFlowOptsZs :: [CmmZ] -> [CmmZ]
runCmmContFlowOptsZs prog
  = [ runTx (runCmmOpts cmmCfgOptsZ) cmm_top
    | cmm_top <- prog ]
27 28

cmmCfgOpts  :: Tx (ListGraph CmmStmt)
29
cmmCfgOptsZ :: Tx (a, CmmGraph)
30 31

cmmCfgOpts  = branchChainElim  -- boring, but will get more exciting later
32
cmmCfgOptsZ g =
33
  optGraph
34
    (branchChainElimZ `seqTx` blockConcatZ `seqTx` removeUnreachableBlocksZ) g
35 36 37 38
        -- Here branchChainElim can ultimately be replaced
        -- with a more exciting combination of optimisations

runCmmOpts :: Tx g -> Tx (GenCmm d h g)
39
runCmmOpts opt = mapProcs (optProc opt)
40

41 42 43 44 45 46 47
optProc :: Tx g -> Tx (GenCmmTop d h g)
optProc _   top@(CmmData {}) = noTx top
optProc opt (CmmProc info lbl formals g) =
  fmap (CmmProc info lbl formals) (opt g)

optGraph :: Tx g -> Tx (a, g)
optGraph opt (a, g) = fmap (\g' -> (a, g')) (opt g)
48

49 50 51 52
------------------------------------
mapProcs :: Tx (GenCmmTop d h s) -> Tx (GenCmm d h s)
mapProcs f (Cmm tops) = fmap Cmm (mapTx f tops)

53 54
----------------------------------------------------------------
branchChainElim :: Tx (ListGraph CmmStmt)
55 56 57
-- If L is not captured in an instruction, we can remove any
-- basic block of the form L: goto L', and replace L with L' everywhere else.
-- How does L get captured? In a CallArea.
58 59 60 61 62 63 64 65 66 67 68 69 70
branchChainElim (ListGraph blocks)
  | null lone_branch_blocks     -- No blocks to remove
  = noTx (ListGraph blocks)
  | otherwise
  = aTx (ListGraph new_blocks)
  where
    (lone_branch_blocks, others) = partitionWith isLoneBranch blocks
    new_blocks = map (replaceLabels env) others
    env = mkClosureBlockEnv lone_branch_blocks

isLoneBranch :: CmmBasicBlock -> Either (BlockId, BlockId) CmmBasicBlock
isLoneBranch (BasicBlock id [CmmBranch target]) | id /= target = Left (id, target)
isLoneBranch other_block                                       = Right other_block
Thomas Schilling's avatar
Thomas Schilling committed
71
   -- An infinite loop is not a link in a branch chain!
72 73 74 75 76 77 78 79 80 81 82 83 84 85 86

replaceLabels :: BlockEnv BlockId -> CmmBasicBlock -> CmmBasicBlock
replaceLabels env (BasicBlock id stmts)
  = BasicBlock id (map replace stmts)
  where
    replace (CmmBranch id)       = CmmBranch (lookup id)
    replace (CmmCondBranch e id) = CmmCondBranch e (lookup id)
    replace (CmmSwitch e tbl)    = CmmSwitch e (map (fmap lookup) tbl)
    replace other_stmt           = other_stmt

    lookup id = lookupBlockEnv env id `orElse` id 
----------------------------------------------------------------
branchChainElimZ :: Tx CmmGraph
-- Remove any basic block of the form L: goto L',
-- and replace L with L' everywhere else
87
branchChainElimZ g@(G.LGraph eid _)
88 89 90
  | null lone_branch_blocks     -- No blocks to remove
  = noTx g
  | otherwise
91
  = aTx $ replaceLabelsZ env $ G.of_block_list eid (self_branches ++ others)
92 93
  where
    (lone_branch_blocks, others) = partitionWith isLoneBranchZ (G.to_block_list g)
94
    env = mkClosureBlockEnvZ lone_branch_blocks
95
    self_branches =
96 97
      let loop_to (id, _) =
            if lookup id == id then
98
              Just (G.Block id (G.ZLast (G.mkBranchNode id)))
99 100 101
            else
              Nothing
      in  mapMaybe loop_to lone_branch_blocks
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
102
    lookup id = lookupBlockEnv env id `orElse` id 
103

dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
104
isLoneBranchZ :: CmmBlock -> Either (BlockId, BlockId) CmmBlock
105
isLoneBranchZ (G.Block id (G.ZLast (G.LastOther (LastBranch target))))
106 107
    | id /= target  = Left (id,target)
isLoneBranchZ other = Right other
Thomas Schilling's avatar
Thomas Schilling committed
108
   -- An infinite loop is not a link in a branch chain!
109

dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
110
replaceLabelsZ :: BlockEnv BlockId -> CmmGraph -> CmmGraph
111
replaceLabelsZ env = replace_eid . G.map_nodes id middle last
112
  where
113
    replace_eid (G.LGraph eid blocks) = G.LGraph (lookup eid) blocks
114 115 116 117 118
    middle = mapExpDeepMiddle exp
    last l = mapExpDeepLast   exp (last' l)
    last' (LastBranch bid) = LastBranch (lookup bid)
    last' (LastCondBranch p t f) = LastCondBranch p (lookup t) (lookup f)
    last' (LastSwitch e arms) = LastSwitch e (map (liftM lookup) arms)
119
    last' (LastCall t k a res r) = LastCall t (liftM lookup k) a res r
120
    exp (CmmLit (CmmBlock bid)) = CmmLit (CmmBlock (lookup bid))
121 122
    exp   (CmmStackSlot (CallArea (Young id)) i) =
      CmmStackSlot (CallArea (Young (lookup id))) i
123 124 125 126 127 128 129 130 131 132
    exp e = e
    lookup id = fmap lookup (lookupBlockEnv env id) `orElse` id 

replaceBranches :: BlockEnv BlockId -> CmmGraph -> CmmGraph
replaceBranches env g = map_nodes id id last g
  where
    last (LastBranch id)          = LastBranch (lookup id)
    last (LastCondBranch e ti fi) = LastCondBranch e (lookup ti) (lookup fi)
    last (LastSwitch e tbl)       = LastSwitch e (map (fmap lookup) tbl)
    last l@(LastCall {})          = l
133
    lookup id = fmap lookup (lookupBlockEnv env id) `orElse` id 
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
134 135 136 137 138 139

----------------------------------------------------------------
-- Build a map from a block to its set of predecessors. Very useful.
predMap :: G.LastNode l => G.LGraph m l -> BlockEnv BlockSet
predMap g = G.fold_blocks add_preds emptyBlockEnv g -- find the back edges
  where add_preds b env = foldl (add b) env (G.succs b)
140
        add (G.Block bid _) env b' =
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
141 142 143 144 145 146
          extendBlockEnv env b' $
                extendBlockSet (lookupBlockEnv env b' `orElse` emptyBlockSet) bid
----------------------------------------------------------------
-- If a block B branches to a label L, and L has no other predecessors,
-- then we can splice the block starting with L onto the end of B.
-- Because this optmization can be inhibited by unreachable blocks,
147
-- we first take a pass to drops unreachable blocks.
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
148
-- Order matters, so we work bottom up (reverse postorder DFS).
149 150
--
-- To ensure correctness, we have to make sure that the BlockId of the block
151
-- we are about to eliminate is not named in another instruction.
152
--
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
153
-- Note: This optimization does _not_ subsume branch chain elimination.
154 155
blockConcatZ  :: Tx CmmGraph
blockConcatZ = removeUnreachableBlocksZ `seqTx` blockConcatZ'
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
156
blockConcatZ' :: Tx CmmGraph
157 158
blockConcatZ' g@(G.LGraph eid blocks) =
  tx $ replaceLabelsZ concatMap $ G.LGraph eid blocks'
159 160
  where (changed, blocks', concatMap) =
           foldr maybe_concat (False, blocks, emptyBlockEnv) $ G.postorder_dfs g
161
        maybe_concat b@(G.Block bid _) (changed, blocks', concatMap) =
162
          let unchanged = (changed, extendBlockEnv blocks' bid b, concatMap)
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
163 164
          in case G.goto_end $ G.unzip b of
               (h, G.LastOther (LastBranch b')) ->
165
                  if canConcatWith b' then
166 167
                    (True, extendBlockEnv blocks' bid $ splice blocks' h b',
                     extendBlockEnv concatMap b' bid)
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
168 169 170
                  else unchanged
               _ -> unchanged
        num_preds bid = liftM sizeBlockSet (lookupBlockEnv backEdges bid) `orElse` 0
171
        canConcatWith b' = num_preds b' == 1
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
172 173 174
        backEdges = predMap g
        splice blocks' h bid' =
          case lookupBlockEnv blocks' bid' of
175
            Just (G.Block _ t) -> G.zip $ G.ZBlock h t
176
            Nothing -> pprPanic "unknown successor block" (ppr bid' <+> ppr blocks' <+> ppr blocks)
dias@eecs.harvard.edu's avatar
dias@eecs.harvard.edu committed
177
        tx = if changed then aTx else noTx
178 179 180 181 182 183 184 185
----------------------------------------------------------------
mkClosureBlockEnv :: [(BlockId, BlockId)] -> BlockEnv BlockId
mkClosureBlockEnv blocks = mkBlockEnv $ map follow blocks
    where singleEnv = mkBlockEnv blocks
          follow (id, next) = (id, endChain id next)
          endChain orig id = case lookupBlockEnv singleEnv id of
                               Just id' | id /= orig -> endChain orig id'
                               _ -> id
186 187 188 189 190 191 192
mkClosureBlockEnvZ :: [(BlockId, BlockId)] -> BlockEnv BlockId
mkClosureBlockEnvZ blocks = mkBlockEnv $ map follow blocks
    where singleEnv = mkBlockEnv blocks
          follow (id, next) = (id, endChain id next)
          endChain orig id = case lookupBlockEnv singleEnv id of
                               Just id' | id /= orig -> endChain orig id'
                               _ -> id
193 194
----------------------------------------------------------------
removeUnreachableBlocksZ :: Tx CmmGraph
195 196
removeUnreachableBlocksZ g@(G.LGraph id blocks) =
  if length blocks' < sizeBEnv blocks then aTx $ G.of_block_list id blocks'
197
  else noTx g
198
    where blocks' = G.postorder_dfs g