Commit 74280942 authored by nr@eecs.harvard.edu's avatar nr@eecs.harvard.edu

add a function to help identify unique predecessors

parent ffd3598e
module CmmZipUtil
( zipPreds
, givesUniquePredecessorTo
)
where
import Prelude hiding (last, unzip)
import ZipCfg
import Maybes
import UniqSet
-- | Compute the predecessors of each *reachable* block
zipPreds :: LastNode l => LGraph m l -> BlockEnv BlockSet
......@@ -15,3 +18,22 @@ zipPreds g = foldl add emptyBlockEnv (postorder_dfs g)
let preds = lookupBlockEnv env sid `orElse` emptyBlockSet
in extendBlockEnv env sid (extendBlockSet preds id))
env (succs block)
-- | Tell if a graph gives a block a unique predecessor. For
-- efficiency, this function is designed to be partially applied.
givesUniquePredecessorTo :: LastNode l => LGraph m l -> BlockId -> Bool
givesUniquePredecessorTo g = \id -> elemBlockSet id singlePreds
-- | accumulates a pair of sets: the set of all blocks containing a single
-- predecessor, and the set of all blocks containing at least two predecessors
where (singlePreds, _) = fold_blocks add (emptyBlockSet, emptyBlockSet) g
add b (single, multi) = foldl add_pred (single, multi) (succs b)
add_pred pair@(single, multi) id =
if elemBlockSet id multi then pair
else if elemBlockSet id single then
(delOneFromUniqSet single id, extendBlockSet multi id)
else
(extendBlockSet single id, multi)
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment