This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
[patch] gcc/*.[ch]: Fix comment typos. Follow spellingconventions.
- From: Kazu Hirata <kazu at cs dot umass dot edu>
- To: gcc-patches at gcc dot gnu dot org
- Date: Sat, 12 Feb 2005 10:19:28 -0500 (EST)
- Subject: [patch] gcc/*.[ch]: Fix comment typos. Follow spellingconventions.
Hi,
Committed as obvious.
Kazu Hirata
2005-02-12 Kazu Hirata <kazu@cs.umass.edu>
* c-tree.h, combine.c, expmed.c, flow.c, libgcc2.c,
simplify-rtx.c, tree-ssa-live.h: Fix comment typos. Follow
spelling conventions.
Index: c-tree.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/c-tree.h,v
retrieving revision 1.192
diff -u -d -p -r1.192 c-tree.h
--- c-tree.h 18 Jan 2005 11:36:00 -0000 1.192
+++ c-tree.h 12 Feb 2005 15:13:50 -0000
@@ -126,7 +126,7 @@ struct c_expr
/* The value of the expression. */
tree value;
/* Record the original binary operator of an expression, which may
- have been changed by fold, STRING_CST for unparenthesised string
+ have been changed by fold, STRING_CST for unparenthesized string
constants, or ERROR_MARK for other expressions (including
parenthesized expressions). */
enum tree_code original_code;
Index: combine.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/combine.c,v
retrieving revision 1.474
diff -u -d -p -r1.474 combine.c
--- combine.c 3 Feb 2005 09:09:16 -0000 1.474
+++ combine.c 12 Feb 2005 15:13:53 -0000
@@ -1276,7 +1276,7 @@ can_combine_p (rtx insn, rtx i3, rtx pre
/* If the clobber represents an earlyclobber operand, we must not
substitute an expression containing the clobbered register.
- As we do not analyse the constraint strings here, we have to
+ As we do not analyze the constraint strings here, we have to
make the conservative assumption. However, if the register is
a fixed hard reg, the clobber cannot represent any operand;
we leave it up to the machine description to either accept or
Index: expmed.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/expmed.c,v
retrieving revision 1.222
diff -u -d -p -r1.222 expmed.c
--- expmed.c 6 Feb 2005 15:39:00 -0000 1.222
+++ expmed.c 12 Feb 2005 15:13:54 -0000
@@ -1089,7 +1089,7 @@ extract_bit_field (rtx str_rtx, unsigned
}
/* If we have an out-of-bounds access to a register, just return an
- uninitialised register of the required mode. This can occur if the
+ uninitialized register of the required mode. This can occur if the
source code contains an out-of-bounds access to a small array. */
if (REG_P (op0) && bitnum >= GET_MODE_BITSIZE (GET_MODE (op0)))
return gen_reg_rtx (tmode);
Index: flow.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/flow.c,v
retrieving revision 1.615
diff -u -d -p -r1.615 flow.c
--- flow.c 24 Jan 2005 08:54:15 -0000 1.615
+++ flow.c 12 Feb 2005 15:13:55 -0000
@@ -2891,7 +2891,7 @@ mark_regno_cond_dead (struct propagate_b
/* Otherwise this is a conditional set. Record that fact.
It may have been conditionally used, or there may be a
- subsequent set with a complimentary condition. */
+ subsequent set with a complementary condition. */
node = splay_tree_lookup (pbi->reg_cond_dead, regno);
if (node == NULL)
Index: libgcc2.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/libgcc2.c,v
retrieving revision 1.182
diff -u -d -p -r1.182 libgcc2.c
--- libgcc2.c 12 Feb 2005 00:26:51 -0000 1.182
+++ libgcc2.c 12 Feb 2005 15:13:55 -0000
@@ -1553,7 +1553,7 @@ NAME (TYPE x, Wtype m)
/* All of these would be present in a full C99 implementation of <math.h>
and <complex.h>. Our problem is that only a few systems have such full
- implementations. Further, libgcc_s.so isn't currenly linked against
+ implementations. Further, libgcc_s.so isn't currently linked against
libm.so, and even for systems that do provide full C99, the extra overhead
of all programs using libgcc having to link against libm. So avoid it. */
@@ -1653,7 +1653,7 @@ CONCAT3(__div,MODE,3) (MTYPE a, MTYPE b,
{
MTYPE denom, ratio, x, y;
- /* ??? We can get better behaviour from logrithmic scaling instead of
+ /* ??? We can get better behavior from logarithmic scaling instead of
the division. But that would mean starting to link libgcc against
libm. We could implement something akin to ldexp/frexp as gcc builtins
fairly easily... */
@@ -1673,7 +1673,7 @@ CONCAT3(__div,MODE,3) (MTYPE a, MTYPE b,
}
/* Recover infinities and zeros that computed as NaN+iNaN; the only cases
- are non-zero/zero, infinite/finite, and finite/infinite. */
+ are nonzero/zero, infinite/finite, and finite/infinite. */
if (isnan (x) && isnan (y))
{
if (denom == 0.0 && (!isnan (a) || !isnan (b)))
Index: simplify-rtx.c
===================================================================
RCS file: /cvs/gcc/gcc/gcc/simplify-rtx.c,v
retrieving revision 1.227
diff -u -d -p -r1.227 simplify-rtx.c
--- simplify-rtx.c 8 Feb 2005 03:38:26 -0000 1.227
+++ simplify-rtx.c 12 Feb 2005 15:13:56 -0000
@@ -1925,7 +1925,7 @@ simplify_binary_operation (enum rtx_code
return const0_rtx;
/* Transform (and (extend X) C) into (zero_extend (and X C)) if
- there are no non-zero bits of C outside of X's mode. */
+ there are no nonzero bits of C outside of X's mode. */
if ((GET_CODE (op0) == SIGN_EXTEND
|| GET_CODE (op0) == ZERO_EXTEND)
&& GET_CODE (trueop1) == CONST_INT
Index: tree-ssa-live.h
===================================================================
RCS file: /cvs/gcc/gcc/gcc/tree-ssa-live.h,v
retrieving revision 2.11
diff -u -d -p -r2.11 tree-ssa-live.h
--- tree-ssa-live.h 17 Nov 2004 22:06:00 -0000 2.11
+++ tree-ssa-live.h 12 Feb 2005 15:13:57 -0000
@@ -428,7 +428,7 @@ tpa_decompact(tpa_p tpa)
}
-/* Once a var_map has been created and compressed, a complimentary root_var
+/* Once a var_map has been created and compressed, a complementary root_var
object can be built. This creates a list of all the root variables from
which ssa version names are derived. Each root variable has a list of
which partitions are versions of that root.