forked from OSchip/llvm-project
parent
37c3c2d0ca
commit
e4b073a4e8
|
@ -13,7 +13,7 @@
|
||||||
/// dominance queries on the CFG, but is fully generic w.r.t. the underlying
|
/// dominance queries on the CFG, but is fully generic w.r.t. the underlying
|
||||||
/// graph types.
|
/// graph types.
|
||||||
///
|
///
|
||||||
/// Unlike ADT/* graph algorithms, generic dominator tree has more reuiqrement
|
/// Unlike ADT/* graph algorithms, generic dominator tree has more requirements
|
||||||
/// on the graph's NodeRef. The NodeRef should be a pointer and, depending on
|
/// on the graph's NodeRef. The NodeRef should be a pointer and, depending on
|
||||||
/// the implementation, e.g. NodeRef->getParent() return the parent node.
|
/// the implementation, e.g. NodeRef->getParent() return the parent node.
|
||||||
///
|
///
|
||||||
|
|
Loading…
Reference in New Issue