diff options
author | tomsmeding <tom.smeding@gmail.com> | 2019-11-29 12:01:43 +0100 |
---|---|---|
committer | tomsmeding <tom.smeding@gmail.com> | 2019-11-30 10:19:16 +0100 |
commit | 5347cb83e730a84fabe162dfc722132cc3ed0f75 (patch) | |
tree | 8fc73547c30f66365eb5d48e73ac11e9e302da66 /Optimiser.hs | |
parent | fbe7dbf3b1efe3615f87f0327871ebfd80f1e050 (diff) |
WIP push temporaries before calls
Requires liveness analysis
Diffstat (limited to 'Optimiser.hs')
-rw-r--r-- | Optimiser.hs | 15 |
1 files changed, 1 insertions, 14 deletions
diff --git a/Optimiser.hs b/Optimiser.hs index 01267e2..626cb50 100644 --- a/Optimiser.hs +++ b/Optimiser.hs @@ -9,6 +9,7 @@ import qualified Data.Set as Set import AST (Name) import Intermediate +import Util optimise :: IRProgram -> IRProgram @@ -219,17 +220,3 @@ readTempsR RNone = [] mapFoldl :: (s -> a -> (s, b)) -> s -> [a] -> (s, [b]) mapFoldl f s = fmap reverse . foldl' (\(s', yet) x -> fmap (: yet) (f s' x)) (s, []) - -uniq :: Eq a => [a] -> [a] -uniq (x:y:zs) | x == y = uniq (y:zs) - | otherwise = x : uniq (y:zs) -uniq l = l - -oppositeGraph :: (Show a, Ord a) => Map.Map a [a] -> Map.Map a [a] -oppositeGraph graph = - let nodes = concat [k : vs | (k, vs) <- Map.assocs graph] - edges = map ((,) <$> fst . head <*> map snd) - . groupBy ((==) `on` fst) - . sortOn fst - $ [(to, from) | (from, tos) <- Map.assocs graph, to <- tos] - in Map.fromList (map (,[]) nodes ++ edges) |