This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[patch] gcc/*: Fix comment typos.
- From: Kazu Hirata <kazu at cs dot umass dot edu>
- To: gcc-patches at gcc dot gnu dot org
- Date: Wed, 06 Apr 2005 13:04:32 -0400 (EDT)
- Subject: [patch] gcc/*: Fix comment typos.
Hi,
Committed as obvious.
Kazu Hirata
2005-04-06 Kazu Hirata <kazu@cs.umass.edu>
* cse.c, tree-flow-inline.h, tree-flow.h, tree-ssa-operands.c,
tree-ssa-sink.c, tree.h, config/bfin/bfin.c,
config/bfin/bfin.h: Fix comment typos.
Index: cse.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/cse.c,v
retrieving revision 1.352
diff -u -d -p -r1.352 cse.c
--- cse.c 5 Apr 2005 14:50:32 -0000 1.352
+++ cse.c 6 Apr 2005 16:56:05 -0000
@@ -3808,7 +3808,7 @@ fold_rtx (rtx x, rtx insn)
/* It's not safe to substitute the operand of a conversion
operator with a constant, as the conversion's identity
- depends upon the mode of it's operand. This optimization
+ depends upon the mode of its operand. This optimization
is handled by the call to simplify_unary_operation. */
if (GET_RTX_CLASS (code) == RTX_UNARY
&& GET_MODE (replacements[j]) != mode_arg0
Index: tree-flow-inline.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-flow-inline.h,v
retrieving revision 2.35
diff -u -d -p -r2.35 tree-flow-inline.h
--- tree-flow-inline.h 5 Apr 2005 19:05:00 -0000 2.35
+++ tree-flow-inline.h 6 Apr 2005 16:56:05 -0000
@@ -347,12 +347,12 @@ next_safe_imm_use (imm_use_iterator *imm
use_operand_p old;
old = imm->imm_use;
- /* If the next node following the iter_node is still the one refered to by
- imm_use, then the list hasnt changed, go to the next node. */
+ /* If the next node following the iter_node is still the one referred to by
+ imm_use, then the list hasn't changed, go to the next node. */
if (imm->iter_node.next == imm->imm_use)
{
ptr = &(imm->iter_node);
- /* Remove iternode fromn the list. */
+ /* Remove iternode from the list. */
delink_imm_use (ptr);
imm->imm_use = imm->imm_use->next;
if (! end_safe_imm_use_p (imm))
@@ -369,7 +369,7 @@ next_safe_imm_use (imm_use_iterator *imm
else
{
/* If the 'next' value after the iterator isn't the same as it was, then
- a node has been deleted, so we sinply proceed to the node following
+ a node has been deleted, so we simply proceed to the node following
where the iterator is in the list. */
imm->imm_use = imm->iter_node.next;
if (end_safe_imm_use_p (imm))
@@ -382,7 +382,7 @@ next_safe_imm_use (imm_use_iterator *imm
return imm->imm_use;
}
-/* Return true is IMM has reached the end of the immeidate use list. */
+/* Return true is IMM has reached the end of the immediate use list. */
static inline bool
end_readonly_imm_use_p (imm_use_iterator *imm)
{
@@ -447,7 +447,7 @@ has_single_use (tree var)
}
/* If VAR has only a single immediate use, return true, and set USE_P and STMT
- to the use pointer and stmt of occurence. */
+ to the use pointer and stmt of occurrence. */
static inline bool
single_imm_use (tree var, use_operand_p *use_p, tree *stmt)
{
@@ -684,7 +684,7 @@ phi_arg_index_from_use (use_operand_p us
int index;
tree phi;
- /* Since the use is the first thing in a PHI arguemnt element, we can
+ /* Since the use is the first thing in a PHI argument element, we can
calculate its index based on casting it to an argument, and performing
pointer arithmetic. */
@@ -697,7 +697,7 @@ phi_arg_index_from_use (use_operand_p us
#ifdef ENABLE_CHECKING
/* Make sure the calculation doesn't have any leftover bytes. If it does,
- then imm_use is liekly not the first element in phi_arg_d. */
+ then imm_use is likely not the first element in phi_arg_d. */
gcc_assert (
(((char *)element - (char *)root) % sizeof (struct phi_arg_d)) == 0);
gcc_assert (index >= 0 && index < PHI_ARG_CAPACITY (phi));
Index: tree-flow.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-flow.h,v
retrieving revision 2.90
diff -u -d -p -r2.90 tree-flow.h
--- tree-flow.h 5 Apr 2005 23:52:41 -0000 2.90
+++ tree-flow.h 6 Apr 2005 16:56:06 -0000
@@ -243,7 +243,7 @@ typedef struct immediate_use_iterator_d
} imm_use_iterator;
-/* Use this iterator when simply looking at stmts. Adding, deleteing or
+/* Use this iterator when simply looking at stmts. Adding, deleting or
modifying stmts will cause this iterator to malfunction. */
#define FOR_EACH_IMM_USE_FAST(DEST, ITER, SSAVAR) \
Index: tree-ssa-operands.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-operands.c,v
retrieving revision 2.72
diff -u -d -p -r2.72 tree-ssa-operands.c
--- tree-ssa-operands.c 5 Apr 2005 22:23:11 -0000 2.72
+++ tree-ssa-operands.c 6 Apr 2005 16:56:07 -0000
@@ -993,7 +993,7 @@ append_v_must_def (tree var)
/* Parse STMT looking for operands. OLD_OPS is the original stmt operand
- cache for STMT, if it exested before. When fniished, the various build_*
+ cache for STMT, if it existed before. When finished, the various build_*
operand vectors will have potential operands. in them. */
static void
Index: tree-ssa-sink.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-sink.c,v
retrieving revision 1.3
diff -u -d -p -r1.3 tree-ssa-sink.c
--- tree-ssa-sink.c 5 Apr 2005 19:05:14 -0000 1.3
+++ tree-ssa-sink.c 6 Apr 2005 16:56:08 -0000
@@ -79,7 +79,7 @@ static struct
} sink_stats;
-/* Given a PHI, and one of it's arguments (DEF), find the edge for
+/* Given a PHI, and one of its arguments (DEF), find the edge for
that argument and return it. If the argument occurs twice in the PHI node,
we return NULL. */
Index: tree.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree.h,v
retrieving revision 1.710
diff -u -d -p -r1.710 tree.h
--- tree.h 5 Apr 2005 19:05:20 -0000 1.710
+++ tree.h 6 Apr 2005 16:56:11 -0000
@@ -1350,7 +1350,7 @@ struct ptr_info_def;
-/* Immediate use linking structure. THis structure is used for maintaining
+/* Immediate use linking structure. This structure is used for maintaining
a doubly linked list of uses of an SSA_NAME. */
typedef struct ssa_imm_use_d GTY(())
{
@@ -1396,7 +1396,7 @@ struct tree_ssa_name GTY(())
you wish to access the use or def fields of a PHI_NODE in the SSA
optimizers, use the accessor macros found in tree-ssa-operands.h.
These two macros are to be used only by those accessor macros, and other
- select places where we *absolutly* must take the address of the tree. */
+ select places where we *absolutely* must take the address of the tree. */
#define PHI_RESULT_TREE(NODE) PHI_NODE_CHECK (NODE)->phi.result
#define PHI_ARG_DEF_TREE(NODE, I) PHI_NODE_ELT_CHECK (NODE, I).def
Index: config/bfin/bfin.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/config/bfin/bfin.c,v
retrieving revision 1.1
diff -u -d -p -r1.1 bfin.c
--- config/bfin/bfin.c 5 Apr 2005 11:26:48 -0000 1.1
+++ config/bfin/bfin.c 6 Apr 2005 16:56:12 -0000
@@ -1,4 +1,4 @@
-/* The Blackfin code generation auxilary output file.
+/* The Blackfin code generation auxiliary output file.
Copyright (C) 2005 Free Software Foundation, Inc.
Contributed by Analog Devices.
@@ -320,7 +320,7 @@ setup_incoming_varargs (CUMULATIVE_ARGS
/* The move for named arguments will be generated automatically by the
compiler. We need to generate the move rtx for the unnamed arguments
- if they are in the first 3 words. We assume atleast 1 named argument
+ if they are in the first 3 words. We assume at least 1 named argument
exists, so we never generate [ARGP] = R0 here. */
for (i = cum->words + 1; i < max_arg_registers; i++)
Index: config/bfin/bfin.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/config/bfin/bfin.h,v
retrieving revision 1.1
diff -u -d -p -r1.1 bfin.h
--- config/bfin/bfin.h 5 Apr 2005 11:26:48 -0000 1.1
+++ config/bfin/bfin.h 6 Apr 2005 16:56:13 -0000
@@ -345,7 +345,7 @@ enum reg_class
BREGS,
LREGS,
MREGS,
- CIRCREGS, /* Circular buffering registers, Ix, Bx, Lx together form. See Automatic Circlur Buffering */
+ CIRCREGS, /* Circular buffering registers, Ix, Bx, Lx together form. See Automatic Circular Buffering. */
DAGREGS,
EVEN_AREGS,
ODD_AREGS,