This module defines control flow graphs over the LLVM IR.
The type of function control flow graphs.
This instance does not compare the graphs directly - instead it compares just the function from which the graph is constructed. The construction is completely deterministic so this should be fine. It is also fast because function comparison just compares unique integer IDs.
Note that this instance constructs the postdominator tree from scratch.
Note, this instance constructs the dominator tree and could be expensive
A class for things from which a CFG can be obtained.