diff options
| author | Kazu Hirata <kazu@cs.umass.edu> | 2005-04-09 16:43:43 +0000 |
|---|---|---|
| committer | Kazu Hirata <kazu@gcc.gnu.org> | 2005-04-09 16:43:43 +0000 |
| commit | f3b569ca7e724b2fc9b8393af5ede3ab9e8a46ea (patch) | |
| tree | 01d7f445c0b42a47b3a2d065df15bc21f86579b3 /gcc/tree-ssa-operands.c | |
| parent | 7b0cab995daec07d1fddae14c57918ae0c30fb21 (diff) | |
| download | gcc-f3b569ca7e724b2fc9b8393af5ede3ab9e8a46ea.zip gcc-f3b569ca7e724b2fc9b8393af5ede3ab9e8a46ea.tar.gz gcc-f3b569ca7e724b2fc9b8393af5ede3ab9e8a46ea.tar.bz2 | |
dominance.c, [...]: Fix comment typos.
* dominance.c, gthr-win32.h, reg-stack.c, tree-ssa-copy.c,
tree-ssa-operands.c, tree-ssa.c, tree-vrp.c, varasm.c,
config/alpha/alpha.c, config/arm/arm.c, config/m32r/m32r.h,
config/rs6000/predicates.md: Fix comment typos.
From-SVN: r97904
Diffstat (limited to 'gcc/tree-ssa-operands.c')
| -rw-r--r-- | gcc/tree-ssa-operands.c | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/gcc/tree-ssa-operands.c b/gcc/tree-ssa-operands.c index 62bb8c9..9c009f7 100644 --- a/gcc/tree-ssa-operands.c +++ b/gcc/tree-ssa-operands.c @@ -67,7 +67,7 @@ Boston, MA 02111-1307, USA. */ on each of the 5 operand vectors which have been built up. If the stmt had a previous operand cache, the finalization routines - attempt to match up the new operands with the old ones. If its a perfect + attempt to match up the new operands with the old ones. If it's a perfect match, the old vector is simply reused. If it isn't a perfect match, then a new vector is created and the new operands are placed there. For virtual operands, if the previous cache had SSA_NAME version of a @@ -473,7 +473,7 @@ correct_use_link (ssa_imm_use_t *ptr, tree stmt) if (prev) { bool stmt_mod = true; - /* Find the first element which isn't a SAFE iterator, is in a sifferent + /* Find the first element which isn't a SAFE iterator, is in a different stmt, and is not a a modified stmt, That node is in the correct list, see if we are too. */ @@ -493,7 +493,7 @@ correct_use_link (ssa_imm_use_t *ptr, tree stmt) root = prev->stmt; else root = *(prev->use); - /* If its the right list, simply return. */ + /* If it's the right list, simply return. */ if (root == *(ptr->use)) return; } |