diff options
| -rw-r--r-- | gcc/ChangeLog | 6 | ||||
| -rw-r--r-- | gcc/c-tree.h | 2 | ||||
| -rw-r--r-- | gcc/combine.c | 2 | ||||
| -rw-r--r-- | gcc/expmed.c | 2 | ||||
| -rw-r--r-- | gcc/flow.c | 2 | ||||
| -rw-r--r-- | gcc/libgcc2.c | 6 | ||||
| -rw-r--r-- | gcc/simplify-rtx.c | 2 | ||||
| -rw-r--r-- | gcc/tree-ssa-live.h | 2 |
8 files changed, 15 insertions, 9 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 51fa9d80312..06ad3a43b9c 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +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. + 2005-02-12 Ira Rosen <irar@il.ibm.com> * tree-vectorizer.c (vect_get_base_and_offset): Remove. diff --git a/gcc/c-tree.h b/gcc/c-tree.h index 073f93ec385..1cde4828348 100644 --- a/gcc/c-tree.h +++ b/gcc/c-tree.h @@ -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; diff --git a/gcc/combine.c b/gcc/combine.c index ae773b96517..73b12bb4f0c 100644 --- a/gcc/combine.c +++ b/gcc/combine.c @@ -1276,7 +1276,7 @@ can_combine_p (rtx insn, rtx i3, rtx pred ATTRIBUTE_UNUSED, rtx succ, /* 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 diff --git a/gcc/expmed.c b/gcc/expmed.c index 1a1bdf74b04..49b1faa77cf 100644 --- a/gcc/expmed.c +++ b/gcc/expmed.c @@ -1089,7 +1089,7 @@ extract_bit_field (rtx str_rtx, unsigned HOST_WIDE_INT bitsize, } /* 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); diff --git a/gcc/flow.c b/gcc/flow.c index 0aa23c03d22..1ab2a94567f 100644 --- a/gcc/flow.c +++ b/gcc/flow.c @@ -2891,7 +2891,7 @@ mark_regno_cond_dead (struct propagate_block_info *pbi, int regno, rtx cond) /* 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) diff --git a/gcc/libgcc2.c b/gcc/libgcc2.c index df2ecb7a4e5..56a9bc4e87a 100644 --- a/gcc/libgcc2.c +++ b/gcc/libgcc2.c @@ -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 c, MTYPE d) { 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, MTYPE c, MTYPE d) } /* 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))) diff --git a/gcc/simplify-rtx.c b/gcc/simplify-rtx.c index 95735e6f4cd..dc452dbdc26 100644 --- a/gcc/simplify-rtx.c +++ b/gcc/simplify-rtx.c @@ -1925,7 +1925,7 @@ simplify_binary_operation (enum rtx_code code, enum machine_mode mode, 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 diff --git a/gcc/tree-ssa-live.h b/gcc/tree-ssa-live.h index fc16fddec72..b2a85c94797 100644 --- a/gcc/tree-ssa-live.h +++ b/gcc/tree-ssa-live.h @@ -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. |