From e0bb17a83f613106571d3b516168d12cf83b10be Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Tue, 1 Jul 2003 12:18:01 +0000 Subject: basic-block.h: Fix comment typos. * basic-block.h: Fix comment typos. * bb-reorder.c: Likewise. * c-format.c: Likewise. * cfgcleanup.c: Likewise. * cfghooks.h: Likewise. * cfgloop.c: Likewise. * cfgloopmanip.c: Likewise. * cfgrtl.c: Likewise. * cgraph.h: Likewise. * cgraphunit.c: Likewise. * combine.c: Likewise. * convert.c: Likewise. * dbxout.c: Likewise. * df.c: Likewise. * df.h: Likewise. * diagnostic.c: Likewise. * dwarf2out.c: Likewise. * et-forest.h: Likewise. * flow.c: Likewise. * fold-const.c: Likewise. * function.h: Likewise. * gcov-io.h: Likewise. * gcov.c: Likewise. * gcse.c: Likewise. * genautomata.c: Likewise. * ggc-common.c: Likewise. * ggc-page.c: Likewise. * loop-unroll.c: Likewise. * loop-unswitch.c: Likewise. * loop.c: Likewise. * mips-tfile.c: Likewise. * optabs.c: Likewise. * ra-build.c: Likewise. * ra-colorize.c: Likewise. * ra-rewrite.c: Likewise. * ra.h: Likewise. * regmove.c: Likewise. * reload.c: Likewise. * rtlanal.c: Likewise. * sched-ebb.c: Likewise. * sched-int.h: Likewise. * sched-vis.c: Likewise. * sreal.c: Likewise. * ssa-ccp.c: Likewise. * ssa.c: Likewise. * toplev.c: Likewise. * tree-inline.c: Likewise. * value-prof.c: Likewise. * value-prof.h: Likewise. From-SVN: r68770 --- gcc/ssa.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'gcc/ssa.c') diff --git a/gcc/ssa.c b/gcc/ssa.c index 5b15b13..2484582 100644 --- a/gcc/ssa.c +++ b/gcc/ssa.c @@ -499,7 +499,7 @@ find_evaluations (evals, nregs) /* Computing the Dominance Frontier: - As decribed in Morgan, section 3.5, this may be done simply by + As described in Morgan, section 3.5, this may be done simply by walking the dominator tree bottom-up, computing the frontier for the children before the parent. When considering a block B, there are two cases: -- cgit v1.1