Safe Haskell	None
Language	GHC2021

Language.QBE.Analysis.Graph

Synopsis

type Node = Int
type Path = [Node]
type Edge = (Node, Node)
type Graph = IntMap IntSet
type Rooted = (Node, Graph)
idom :: Rooted -> [(Node, Node)]
ipdom :: Rooted -> [(Node, Node)]
domTree :: Rooted -> Tree Node
pdomTree :: Rooted -> Tree Node
dom :: Rooted -> [(Node, Path)]
pdom :: Rooted -> [(Node, Path)]
pddfs :: Rooted -> [Node]
rpddfs :: Rooted -> [Node]
fromAdj :: [(Node, [Node])] -> Graph
fromEdges :: [Edge] -> Graph
toAdj :: Graph -> [(Node, [Node])]
toEdges :: Graph -> [Edge]
asTree :: Rooted -> Tree Node
asGraph :: Tree Node -> Rooted
parents :: Tree a -> [(a, a)]
ancestors :: Tree a -> [(a, [a])]

Documentation

type Node = Int Source #

type Path = [Node] Source #

type Edge = (Node, Node) Source #

type Graph = IntMap IntSet Source #

type Rooted = (Node, Graph) Source #

idom :: Rooted -> [(Node, Node)] Source #

Immediate dominators. O(|E|*alpha(|E|,|V|)), where alpha(m,n) is "a functional inverse of Ackermann's function".

This Complexity bound assumes O(1) indexing. Since we're using IntMap, it has an additional lg |V| factor somewhere in there. I'm not sure where.

ipdom :: Rooted -> [(Node, Node)] Source #

Immediate post-dominators. Complexity as for idom.

domTree :: Rooted -> Tree Node Source #

Dominator tree. Complexity as for idom.

pdomTree :: Rooted -> Tree Node Source #

Post-dominator tree. Complexity as for idom.

dom :: Rooted -> [(Node, Path)] Source #

Dominators. Complexity as for idom

pdom :: Rooted -> [(Node, Path)] Source #

Post-dominators. Complexity as for idom.

pddfs :: Rooted -> [Node] Source #

Post-dominated depth-first search.

rpddfs :: Rooted -> [Node] Source #

Reverse post-dominated depth-first search.

fromAdj :: [(Node, [Node])] -> Graph Source #

fromEdges :: [Edge] -> Graph Source #

toAdj :: Graph -> [(Node, [Node])] Source #

toEdges :: Graph -> [Edge] Source #

asTree :: Rooted -> Tree Node Source #

asGraph :: Tree Node -> Rooted Source #

parents :: Tree a -> [(a, a)] Source #

ancestors :: Tree a -> [(a, [a])] Source #