Commit 46ae1087 by Richard Henderson Committed by Richard Henderson

tree-vect-transform.c (vect_create_epilog_for_reduction): Remove duplicate…

tree-vect-transform.c (vect_create_epilog_for_reduction): Remove duplicate little-endian adjustment.

        * tree-vect-transform.c (vect_create_epilog_for_reduction): Remove
        duplicate little-endian adjustment.

From-SVN: r101372
parent 54c885c5
2005-06-27 Richard Henderson <rth@redhat.com>
* tree-vect-transform.c (vect_create_epilog_for_reduction): Remove
duplicate little-endian adjustment.
2005-06-28 Kelley Cook <kcook@gcc.gnu.org> 2005-06-28 Kelley Cook <kcook@gcc.gnu.org>
* doc/include/texinfo.tex: Import from upstream CVS. * doc/include/texinfo.tex: Import from upstream CVS.
......
...@@ -926,17 +926,12 @@ vect_create_epilog_for_reduction (tree vect_def, tree stmt, tree reduction_op, ...@@ -926,17 +926,12 @@ vect_create_epilog_for_reduction (tree vect_def, tree stmt, tree reduction_op,
int vec_size_in_bits = tree_low_cst (TYPE_SIZE (vectype), 1); int vec_size_in_bits = tree_low_cst (TYPE_SIZE (vectype), 1);
tree vec_temp; tree vec_temp;
/* The result of the reduction is expected to be at the LSB bits /* The result of the reduction is expected to be at the least
of the vector. For big-endian targets this means at the right significant bits of the vector. This is merely convention,
end of the vector. For little-endian targets this means at the as it's the extraction later that really matters, and that
left end of the vector. */ is also under our control. */
if (vec_shr_optab->handlers[mode].insn_code != CODE_FOR_nothing)
if (BITS_BIG_ENDIAN
&& vec_shr_optab->handlers[mode].insn_code != CODE_FOR_nothing)
shift_code = VEC_RSHIFT_EXPR; shift_code = VEC_RSHIFT_EXPR;
else if (!BITS_BIG_ENDIAN
&& vec_shl_optab->handlers[mode].insn_code != CODE_FOR_nothing)
shift_code = VEC_LSHIFT_EXPR;
else else
have_whole_vector_shift = false; have_whole_vector_shift = false;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment