diff options
author | Kazu Hirata <kazu@codesourcery.com> | 2006-12-05 08:27:27 +0000 |
---|---|---|
committer | Kazu Hirata <kazu@gcc.gnu.org> | 2006-12-05 08:27:27 +0000 |
commit | 9fc4da9d86e6a74f6919492585022be370676bed (patch) | |
tree | e99d926aabc3d097b17af3ec037198ae6f5684b3 /gcc | |
parent | 20e9e7597fd6296a7cf0dee5950ad462fd90a424 (diff) | |
download | gcc-9fc4da9d86e6a74f6919492585022be370676bed.zip gcc-9fc4da9d86e6a74f6919492585022be370676bed.tar.gz gcc-9fc4da9d86e6a74f6919492585022be370676bed.tar.bz2 |
darwin.h, [...]: Fix comment typos.
* config/i386/darwin.h, config/spu/spu.c, tree-ssa-live.c,
tree-vect-generic.c, tree-vect-transform.c: Fix comment typos.
From-SVN: r119533
Diffstat (limited to 'gcc')
-rw-r--r-- | gcc/ChangeLog | 5 | ||||
-rw-r--r-- | gcc/config/i386/darwin.h | 2 | ||||
-rw-r--r-- | gcc/config/spu/spu.c | 2 | ||||
-rw-r--r-- | gcc/tree-ssa-live.c | 4 | ||||
-rw-r--r-- | gcc/tree-vect-generic.c | 2 | ||||
-rw-r--r-- | gcc/tree-vect-transform.c | 2 |
6 files changed, 11 insertions, 6 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index d2a8743..35e5445 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2006-12-05 Kazu Hirata <kazu@codesourcery.com> + + * config/i386/darwin.h, config/spu/spu.c, tree-ssa-live.c, + tree-vect-generic.c, tree-vect-transform.c: Fix comment typos. + 2006-12-04 Trevor Smigiel <trevor_smigiel@playstation.sony.com> * config/spu/spu-protos.c (spu_split_address): Add. diff --git a/gcc/config/i386/darwin.h b/gcc/config/i386/darwin.h index 50bb634..eef9fe8 100644 --- a/gcc/config/i386/darwin.h +++ b/gcc/config/i386/darwin.h @@ -188,7 +188,7 @@ extern void darwin_x86_file_end (void); } while (0) /* Darwin on x86_64 uses dwarf-2 by default. Pre-darwin9 32-bit - compiles defaut to stabs+. darwin9+ defaults to dwarf-2. */ + compiles default to stabs+. darwin9+ defaults to dwarf-2. */ #ifndef DARWIN_PREFER_DWARF #undef PREFERRED_DEBUGGING_TYPE #define PREFERRED_DEBUGGING_TYPE (TARGET_64BIT ? DWARF2_DEBUG : DBX_DEBUG) diff --git a/gcc/config/spu/spu.c b/gcc/config/spu/spu.c index d6c420a..07680b7 100644 --- a/gcc/config/spu/spu.c +++ b/gcc/config/spu/spu.c @@ -3707,7 +3707,7 @@ spu_rtx_costs (rtx x, int code, int outer_code ATTRIBUTE_UNUSED, int *total) /* Folding to a CONST_VECTOR will use extra space but there might be only a small savings in cycles. We'd like to use a CONST_VECTOR - only if it allows us to fold away multiple insns. Changin the cost + only if it allows us to fold away multiple insns. Changing the cost of a CONST_VECTOR here (or in CONST_COSTS) doesn't help though because this cost will only be compared against a single insn. if (code == CONST_VECTOR) diff --git a/gcc/tree-ssa-live.c b/gcc/tree-ssa-live.c index a632600..f7665cd 100644 --- a/gcc/tree-ssa-live.c +++ b/gcc/tree-ssa-live.c @@ -984,7 +984,7 @@ partition_pair_map_hash (const void *pair) } -/* Return TRUE if PAIR1 is equivilent to PAIR2. */ +/* Return TRUE if PAIR1 is equivalent to PAIR2. */ int partition_pair_map_eq (const void *pair1, const void *pair2) @@ -1112,7 +1112,7 @@ add_coalesce (coalesce_list_p cl, int p1, int p2, } -/* Comparison function to allow qsort to sort P1 and P2 in Ascendiong order. */ +/* Comparison function to allow qsort to sort P1 and P2 in Ascending order. */ static int compare_pairs (const void *p1, const void *p2) diff --git a/gcc/tree-vect-generic.c b/gcc/tree-vect-generic.c index d1ac94f..840c4ab 100644 --- a/gcc/tree-vect-generic.c +++ b/gcc/tree-vect-generic.c @@ -411,7 +411,7 @@ expand_vector_operations_1 (block_stmt_iterator *bsi) gcc_assert (code != CONVERT_EXPR); op = optab_for_tree_code (code, type); - /* For widening/narrowgin vector operations, the relevant type is of the + /* For widening/narrowing vector operations, the relevant type is of the arguments, not the widened result. */ if (code == WIDEN_SUM_EXPR || code == VEC_WIDEN_MULT_HI_EXPR diff --git a/gcc/tree-vect-transform.c b/gcc/tree-vect-transform.c index a33cbaa..896e723 100644 --- a/gcc/tree-vect-transform.c +++ b/gcc/tree-vect-transform.c @@ -3852,7 +3852,7 @@ vect_transform_stmt (tree stmt, block_stmt_iterator *bsi, bool *strided_store) { /* In case of interleaving, the whole chain is vectorized when the last store in the chain is reached. Store stmts before the last - one are skipped, and there vec_stmt_info shoudn't be freed + one are skipped, and there vec_stmt_info shouldn't be freed meanwhile. */ *strided_store = true; if (STMT_VINFO_VEC_STMT (stmt_info)) |