diff options
Diffstat (limited to 'gcc/dominance.c')
| -rw-r--r-- | gcc/dominance.c | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/gcc/dominance.c b/gcc/dominance.c index 6fa765ca3dc..ed64c4f74cf 100644 --- a/gcc/dominance.c +++ b/gcc/dominance.c @@ -1242,9 +1242,9 @@ iterate_fix_dominators (enum cdi_direction dir, VEC (basic_block, heap) *bbs, Then, we need to establish the dominance relation among the basic blocks in BBS. We split the dominance tree by removing the immediate dominator - edges from BBS, creating a forrest F. We form a graph G whose vertices + edges from BBS, creating a forest F. We form a graph G whose vertices are BBS and ENTRY and X -> Y is an edge of G if there exists an edge - X' -> Y in CFG such that X' belongs to the tree of the dominance forrest + X' -> Y in CFG such that X' belongs to the tree of the dominance forest whose root is X. We then determine dominance tree of G. Note that for X, Y in BBS, X dominates Y in CFG if and only if X dominates Y in G. In this step, we can use arbitrary algorithm to determine dominators. |