Commit 77cc133d authored by Michael D. Adams's avatar Michael D. Adams
Browse files

A small move of the comments in ./compiler/cmm/Dataflow.hs

parent 3de1c72b
......@@ -5,10 +5,7 @@ module Dataflow (
--------------------------------------------------------------------------------
-- Solve a fixed-point of a dataflow problem.
-- O(N+H*E) calls to update where
-- N = number of nodes,
-- E = number of edges,
-- H = maximum height of the lattice for any particular node.
--
-- dependants: map from nodes to those who's value depend on the argument node
-- update:
-- Given the node which needs to be updated, and
......@@ -21,6 +18,11 @@ module Dataflow (
-- state: some sort of state (usually a map)
-- containing the initial value for each node
--
-- Complexity: O(N+H*E) calls to 'update' where
-- N = number of nodes,
-- E = number of edges,
-- H = maximum height of the lattice for any particular node.
--
-- Sketch for proof of complexity:
-- Note that the state is threaded through the entire execution.
-- Also note that the height of the latice at any particular node
......
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