This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[patch] tree-*.[ch]: Fix comment typos.
- From: Kazu Hirata <kazu at cs dot umass dot edu>
- To: gcc-patches at gcc dot gnu dot org
- Cc: amacleod at redhat dot com
- Date: Fri, 29 Apr 2005 11:34:01 -0400 (EDT)
- Subject: [patch] tree-*.[ch]: Fix comment typos.
Hi,
Committed as obvious.
Kazu Hirata
2005-04-29 Kazu Hirata <kazu@cs.umass.edu>
* tree-flow-inline.h, tree-ssa-operands.c: Fix comment typos.
Index: tree-flow-inline.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-flow-inline.h,v
retrieving revision 2.42
diff -u -d -p -r2.42 tree-flow-inline.h
--- tree-flow-inline.h 29 Apr 2005 15:06:05 -0000 2.42
+++ tree-flow-inline.h 29 Apr 2005 15:30:04 -0000
@@ -314,7 +314,7 @@ first_safe_imm_use (imm_use_iterator *im
return imm->imm_use;
}
-/* Bump IMM to then next use in the list. */
+/* Bump IMM to the next use in the list. */
static inline use_operand_p
next_safe_imm_use (imm_use_iterator *imm)
{
@@ -332,7 +332,7 @@ next_safe_imm_use (imm_use_iterator *imm
imm->imm_use = imm->imm_use->next;
if (! end_safe_imm_use_p (imm))
{
- /* This isnt the end, link iternode before the next use. */
+ /* This isn't the end, link iternode before the next use. */
ptr->prev = imm->imm_use->prev;
ptr->next = imm->imm_use;
imm->imm_use->prev->next = ptr;
@@ -380,7 +380,7 @@ first_readonly_imm_use (imm_use_iterator
return imm->imm_use;
}
-/* Bump IMM to then next use in the list. */
+/* Bump IMM to the next use in the list. */
static inline use_operand_p
next_readonly_imm_use (imm_use_iterator *imm)
{
Index: tree-ssa-operands.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-operands.c,v
retrieving revision 2.78
diff -u -d -p -r2.78 tree-ssa-operands.c
--- tree-ssa-operands.c 21 Apr 2005 18:05:26 -0000 2.78
+++ tree-ssa-operands.c 29 Apr 2005 15:30:05 -0000
@@ -1198,8 +1198,8 @@ swap_tree_operands (tree *exp0, tree *ex
use1 = x;
break;
}
- /* If both uses don't have operand entries, there isnt much we can do
- at this point. Presumably we dont need to worry about it. */
+ /* If both uses don't have operand entries, there isn't much we can do
+ at this point. Presumably we dont need to worry about it. */
if (use0 != NUM_USES (uses) && use1 != NUM_USES (uses))
{
tree *tmp = USE_OP_PTR (uses, use1)->use;