X-Git-Url: http://git.megacz.com/?p=ghc-hetmet.git;a=blobdiff_plain;f=compiler%2Fcmm%2FPprCmmZ.hs;h=075f0e457b2161039d508b62c8c4e96e9f497d6e;hp=fa930bd88edb2d2f3d1d4b160ea85a577011d4da;hb=edc0bafd3fcd01b85a2e8894e5dfe149eb0e0857;hpb=c0a5a5d2e41341046aaf37c1d2155372e7ed3ee8 diff --git a/compiler/cmm/PprCmmZ.hs b/compiler/cmm/PprCmmZ.hs index fa930bd..075f0e4 100644 --- a/compiler/cmm/PprCmmZ.hs +++ b/compiler/cmm/PprCmmZ.hs @@ -4,102 +4,85 @@ module PprCmmZ ) where -#include "HsVersions.h" - +import BlockId import Cmm -import CmmExpr -import PprCmm() +import PprCmm import Outputable import qualified ZipCfgCmmRep as G import qualified ZipCfg as Z import CmmZipUtil -import UniqSet +import Data.Maybe import FastString ---------------------------------------------------------------- +-- | The purpose of this function is to print a Cmm zipper graph "as if it were" +-- a Cmm program. The objective is dodgy, so it's unsurprising parts of the +-- code are dodgy as well. + pprCmmGraphLikeCmm :: G.CmmGraph -> SDoc pprCmmGraphLikeCmm g = vcat (swallow blocks) where blocks = Z.postorder_dfs g swallow :: [G.CmmBlock] -> [SDoc] swallow [] = [] - swallow (Z.Block id t : rest) = tail id [] t rest - tail id prev' (Z.ZTail m t) rest = tail id (mid m : prev') t rest - tail id prev' (Z.ZLast Z.LastExit) rest = exit id prev' rest - tail id prev' (Z.ZLast (Z.LastOther l))rest = last id prev' l rest - mid (G.CopyIn _ [] _) = text "// proc point (no parameters)" - mid m@(G.CopyIn {}) = ppr m <+> text "(proc point)" + swallow (Z.Block id t : rest) = tail id [] Nothing t rest + tail id prev' out (Z.ZTail m t) rest = tail id (mid m : prev') out t rest + tail id prev' out (Z.ZLast (Z.LastOther l)) rest = last id prev' out l rest + tail id prev' _ (Z.ZLast Z.LastExit) rest = exit id prev' rest mid m = ppr m block' id prev' - | id == Z.gr_entry g, entry_has_no_pred = + | id == Z.lg_entry g, entry_has_no_pred = vcat (text "" : reverse prev') | otherwise = hang (ppr id <> colon) 4 (vcat (reverse prev')) - last id prev' l n = + last id prev' out l n = let endblock stmt = block' id (stmt : prev') : swallow n in case l of - G.LastBranch tgt [] -> + G.LastBranch tgt -> case n of Z.Block id' t : bs | tgt == id', unique_pred id' - -> tail id prev' t bs -- optimize out redundant labels + -> tail id prev' out t bs -- optimize out redundant labels _ -> endblock (ppr $ CmmBranch tgt) - l@(G.LastBranch {}) -> endblock (ppr l) l@(G.LastCondBranch expr tid fid) -> let ft id = text "// fall through to " <> ppr id in case n of Z.Block id' t : bs - | id' == fid, False -> - tail id (ft fid : ppr (CmmCondBranch expr tid) : prev') t bs - | id' == tid, Just e' <- maybeInvertCmmExpr expr, False -> - tail id (ft tid : ppr (CmmCondBranch e' fid) : prev') t bs - _ -> endblock (ppr l) - l@(G.LastJump {}) -> endblock $ ppr l - l@(G.LastReturn {}) -> endblock $ ppr l - l@(G.LastSwitch {}) -> endblock $ ppr l - l@(G.LastCall _ _ Nothing) -> endblock $ ppr l - l@(G.LastCall tgt args (Just k)) - | Z.Block id' (Z.ZTail (G.CopyIn _ ress srt) t) : bs <- n, - id' == k -> - let call = CmmCall tgt ress args (CmmSafe srt) CmmMayReturn - ppcall = ppr call <+> parens (text "ret to" <+> ppr k) - in if unique_pred k then - tail id (ppcall : prev') t bs - else - endblock (ppcall) - | Z.Block id' t : bs <- n, id' == k, unique_pred k, - Just (ress, srt) <- findCopyIn t -> - let call = CmmCall tgt ress args (CmmSafe srt) CmmMayReturn - delayed = - ptext SLIT("// delayed CopyIn follows previous call") - in tail id (delayed : ppr call : prev') t bs - | otherwise -> endblock $ ppr l - findCopyIn (Z.ZTail (G.CopyIn _ ress srt) _) = Just (ress, srt) - findCopyIn (Z.ZTail _ t) = findCopyIn t - findCopyIn (Z.ZLast _) = Nothing + | id' == fid, isNothing out -> + tail id (ft fid : ppr (CmmCondBranch expr tid) : prev') Nothing t bs + | id' == tid, Just e' <- maybeInvertCmmExpr expr, isNothing out-> + tail id (ft tid : ppr (CmmCondBranch e' fid) : prev') Nothing t bs + _ -> endblock $ with_out out l + l@(G.LastSwitch {}) -> endblock $ with_out out l + l@(G.LastCall _ _ _ _ _) -> endblock $ with_out out l exit id prev' n = -- highly irregular (assertion violation?) let endblock stmt = block' id (stmt : prev') : swallow n in endblock (text "// ") -{- - case n of [] -> [text ""] - Z.Block id' t : bs -> - if unique_pred id' then - tail id (ptext SLIT("went thru exit") : prev') t bs - else - endblock (ppr $ CmmBranch id') --} preds = zipPreds g - entry_has_no_pred = case Z.lookupBlockEnv preds (Z.gr_entry g) of + entry_has_no_pred = case lookupBlockEnv preds (Z.lg_entry g) of Nothing -> True - Just s -> isEmptyUniqSet s + Just s -> isEmptyBlockSet s single_preds = let add b single = let id = Z.blockId b - in case Z.lookupBlockEnv preds id of + in case lookupBlockEnv preds id of Nothing -> single - Just s -> if sizeUniqSet s == 1 then - Z.extendBlockSet single id + Just s -> if sizeBlockSet s == 1 then + extendBlockSet single id else single - in Z.fold_blocks add Z.emptyBlockSet g - unique_pred id = Z.elemBlockSet id single_preds - + in Z.fold_blocks add emptyBlockSet g + unique_pred id = elemBlockSet id single_preds +with_out :: Maybe (G.Convention, CmmActuals) -> G.Last -> SDoc +with_out Nothing l = ptext (sLit "??no-arguments??") <+> ppr l +with_out (Just (conv, args)) l = last l + where last (G.LastCall e k _ _ _) = + hcat [ptext (sLit "... = foreign "), + doubleQuotes(ppr conv), space, + ppr_target e, parens ( commafy $ map ppr args ), + ptext (sLit " \"safe\""), + text " returns to " <+> ppr k, + semi ] + last l = ppr l + ppr_target (CmmLit lit) = pprLit lit + ppr_target fn' = parens (ppr fn') + commafy xs = hsep $ punctuate comma xs