mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-04-24 07:40:26 +08:00
Code Issues Packages Projects Releases Wiki Activity

i386: Fix REDUC_SSE_SMINMAX_MODE mode conditions.

Browse Source 
V4SI, V8HI and V16QI modes of redux_<code>_scal_<mode> expander
expand with SSE2 instructions (PSRLDQ and PCMPGTx) so use
TARGET_SSE2 as relevant mode iterator codition.

	PR target/94494
	* config/i386/sse.md (REDUC_SSE_SMINMAX_MODE): Use TARGET_SSE2
	condition for V4SI, V8HI and V16QI modes.

testsuite/ChangeLog:

	PR target/94494
	* gcc.target/i386/pr94494.c: New test.
This commit is contained in:
Uros Bizjak 2020-04-11 11:51:41 +02:00
parent bb87d5cc77
commit f883c46b48
4 changed files with 36 additions and 2 deletions
gcc
ChangeLog
config/i386
sse.md
testsuite
ChangeLog
gcc.target/i386
pr94494.c

6
gcc/ChangeLog

@ -1,3 +1,9 @@
2020-04-11 Uroš Bizjak <ubizjak@gmail.com>
PR target/94494
* config/i386/sse.md (REDUC_SSE_SMINMAX_MODE): Use TARGET_SSE2
condition for V4SI, V8HI and V16QI modes.
2020-04-11 Jakub Jelinek <jakub@redhat.com>
PR debug/94495

4
gcc/config/i386/sse.md

@ -2733,8 +2733,8 @@
;; Modes handled by reduc_sm{in,ax}* patterns.
(define_mode_iterator REDUC_SSE_SMINMAX_MODE
[(V4SF "TARGET_SSE") (V2DF "TARGET_SSE")
(V2DI "TARGET_SSE4_2") (V4SI "TARGET_SSE") (V8HI "TARGET_SSE")
(V16QI "TARGET_SSE")])
(V4SI "TARGET_SSE2") (V8HI "TARGET_SSE2") (V16QI "TARGET_SSE2")
(V2DI "TARGET_SSE4_2")])
(define_expand "reduc_<code>_scal_<mode>"
[(smaxmin:REDUC_SSE_SMINMAX_MODE

5
gcc/testsuite/ChangeLog

@ -1,3 +1,8 @@
2020-04-11 Uroš Bizjak <ubizjak@gmail.com>
PR target/94494
* gcc.target/i386/pr94494.c: New test.
2020-04-11 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/94482

23
gcc/testsuite/gcc.target/i386/pr94494.c Normal file

@ -0,0 +1,23 @@
/* PR target/94494 */
/* { dg-do compile } */
/* { dg-options "-O2 -ftree-vectorize -msse -mno-sse2" } */
void
foo (float *item, float *f, float *out,
int threshold, int wi, int lo, int hi, int value)
{
for (int i = 0; i < wi; i++) {
if (item[i] > 0) {
int found = 0;
for (int k = lo; k < hi; k++)
if (f[k] > 0)
found = 1;
if (found > 0)
out[i] = threshold;
else if (out[i] > value)
out[i] -= 1;
}
}
}