diff options
author | Kazu Hirata <kazu@codesourcery.com> | 2006-12-02 02:26:04 +0000 |
---|---|---|
committer | Kazu Hirata <kazu@gcc.gnu.org> | 2006-12-02 02:26:04 +0000 |
commit | 2f8e468bf32574acaa21dbb8409b579ff8f16b92 (patch) | |
tree | dd382bd43e9be4352a80ae68890c6ba09ba0cad1 /gcc/tree-vect-analyze.c | |
parent | 5681c208fa990b5f827b3fc97ff33c076376e44d (diff) | |
download | gcc-2f8e468bf32574acaa21dbb8409b579ff8f16b92.tar.gz |
builtins.c, [...]: Fix comment typos.
* builtins.c, cfgloop.h, cgraph.h, config/arm/arm.c,
config/i386/i386.c, config/i386/i386.h, config/mips/mips.h,
config/rs6000/cell.md, config/rs6000/rs6000.c, config/sh/sh.c,
config/sh/sh4-300.md, config/spu/spu-builtins.def,
config/spu/spu-c.c, config/spu/spu-modes.def,
config/spu/spu.c, config/spu/spu.md,
config/spu/spu_internals.h, config/spu/vmx2spu.h,
fold-const.c, fwprop.c, predict.c, tree-data-ref.h,
tree-flow.h, tree-ssa-loop-manip.c, tree-ssa-loop-niter.c,
tree-ssa-pre.c, tree-vect-analyze.c, tree-vect-transform.c,
tree-vectorizer.c, tree-vrp.c: Fix comment typos. Follow
spelling conventions.
From-SVN: r119442
Diffstat (limited to 'gcc/tree-vect-analyze.c')
-rw-r--r-- | gcc/tree-vect-analyze.c | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/gcc/tree-vect-analyze.c b/gcc/tree-vect-analyze.c index a0d6e087082..89555151387 100644 --- a/gcc/tree-vect-analyze.c +++ b/gcc/tree-vect-analyze.c @@ -1428,7 +1428,7 @@ vect_enhance_data_refs_alignment (loop_vec_info loop_vinfo) { /* For interleaved access we peel only if number of iterations in the prolog loop ({VF - misalignment}), is a multiple of the - number of the interelaved accesses. */ + number of the interleaved accesses. */ int elem_size, mis_in_elements; int vf = LOOP_VINFO_VECT_FACTOR (loop_vinfo); @@ -2228,7 +2228,8 @@ vect_mark_stmts_to_be_vectorized (loop_vec_info loop_vinfo) is not used inside the loop), it will be vectorized, and therefore the corresponding DEF_STMTs need to marked as relevant. We distinguish between two kinds of relevant stmts - those that are - used by a reduction conputation, and those that are (also) used by a regular computation. This allows us later on to identify stmts + used by a reduction computation, and those that are (also) used by + a regular computation. This allows us later on to identify stmts that are used solely by a reduction, and therefore the order of the results that they produce does not have to be kept. */ |