Provides dominance predicates for control-flow nodes.
These variations of the dominance relation are used for computing SSA
form. Formally, a node
d dominates a node
n if all paths from the
function entry point to
n go through
d; this applies within a function
and only for nodes reachable from the entry point. Unreachable nodes are not
part the dominance relation.
Provides classes and predicates for working with C/C++/ObjC/ObjC++ code.