From c80b4100e044ac1ca52c08d640ccbf03d29e8f05 Mon Sep 17 00:00:00 2001 From: Kazu Hirata Date: Fri, 25 May 2007 22:58:16 +0000 Subject: cfglayout.c, [...]: Fix comment typos. * cfglayout.c, cgraphunit.c, config/avr/avr.c, fold-const.c, haifa-sched.c, optabs.h, tree-affine.c, tree-data-ref.c, tree-predcom.c, tree-ssa-alias-warnings.c, tree-ssa-forwprop.c, tree-vect-analyze.c, tree-vrp.c: Fix comment typos. Follow spelling conventions. * doc/cpp.texi, doc/invoke.texi: Fix typos. From-SVN: r125080 --- gcc/tree-predcom.c | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to 'gcc/tree-predcom.c') diff --git a/gcc/tree-predcom.c b/gcc/tree-predcom.c index 8745969..bae23ed 100644 --- a/gcc/tree-predcom.c +++ b/gcc/tree-predcom.c @@ -793,7 +793,7 @@ end: } /* Returns true if the component COMP satisfies the conditions - described in 2) at the begining of this file. LOOP is the current + described in 2) at the beginning of this file. LOOP is the current loop. */ static bool @@ -850,7 +850,7 @@ suitable_component_p (struct loop *loop, struct component *comp) /* Check the conditions on references inside each of components COMPS, and remove the unsuitable components from the list. The new list of components is returned. The conditions are described in 2) at - the begining of this file. LOOP is the current loop. */ + the beginning of this file. LOOP is the current loop. */ static struct component * filter_suitable_components (struct loop *loop, struct component *comps) @@ -1752,7 +1752,7 @@ execute_pred_commoning (struct loop *loop, VEC (chain_p, heap) *chains, update_ssa (TODO_update_ssa_only_virtuals); } -/* For each reference in CHAINS, if its definining statement is +/* For each reference in CHAINS, if its defining statement is ssa name, set it to phi node that defines it. */ static void @@ -1771,7 +1771,7 @@ replace_phis_by_defined_names (VEC (chain_p, heap) *chains) } } -/* For each reference in CHAINS, if its definining statement is +/* For each reference in CHAINS, if its defining statement is phi node, set it to the ssa name that is defined by it. */ static void @@ -2018,7 +2018,7 @@ find_associative_operation_root (tree stmt, unsigned *distance) /* Returns the common statement in that NAME1 and NAME2 have a use. If there is no such statement, returns NULL_TREE. In case the operation used on - NAME1 and NAME2 is associative and comutative, returns the root of the + NAME1 and NAME2 is associative and commutative, returns the root of the tree formed by this operation instead of the statement that uses NAME1 or NAME2. */ -- cgit v1.1