diff options
| author | Kazu Hirata <kazu@gcc.gnu.org> | 2007-06-13 02:27:04 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2007-06-13 02:27:04 +0000 |
| commit | 0d52bcc19e63766de745d046844e8f2c12c89536 (patch) | |
| tree | 53bc6532998c58f2c87be78479fff08b511afc9a /gcc/dominance.c | |
| parent | ebca1de4384a5c5c563f0d3337999886b01f0f7e (diff) | |
| download | gcc-0d52bcc19e63766de745d046844e8f2c12c89536.zip gcc-0d52bcc19e63766de745d046844e8f2c12c89536.tar.gz gcc-0d52bcc19e63766de745d046844e8f2c12c89536.tar.bz2 | |
auto-inc-dec.c, [...]: Fix comment typos.
* auto-inc-dec.c, c-incpath.c, config/c4x/libgcc.S,
config/sh/divcost-analysis, dbgcnt.def, df-core.c,
df-problems.c, df-scan.c, df.h, dominance.c, dse.c, regstat.c,
tree-data-ref.c, tree-ssa-loop-im.c, tree-ssa-loop-prefetch.c,
tree-vect-transform.c: Fix comment typos. Follow spelling
conventions.
From-SVN: r125666
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 6fa765c..ed64c4f 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. |