| 1 |
/* { dg-do compile { target { ! ia32 } } } */ |
| 2 |
/* { dg-options "-Ofast -march=icelake-server -fdump-tree-slp-details" } */ |
| 3 |
|
| 4 |
typedef unsigned char uint8_t; |
| 5 |
typedef unsigned int uint32_t; |
| 6 |
typedef unsigned short uint16_t; |
| 7 |
|
| 8 |
static inline |
| 9 |
uint32_t abs2 ( uint32_t a ) |
| 10 |
{ |
| 11 |
uint32_t s = ((a>>15)&0x10001)*0xffff; |
| 12 |
return (a+s)^s; |
| 13 |
} |
| 14 |
|
| 15 |
#define HADAMARD4(d0, d1, d2, d3, s0, s1, s2, s3) {\ |
| 16 |
int t0 = s0 + s1;\ |
| 17 |
int t1 = s0 - s1;\ |
| 18 |
int t2 = s2 + s3;\ |
| 19 |
int t3 = s2 - s3;\ |
| 20 |
d0 = t0 + t2;\ |
| 21 |
d2 = t0 - t2;\ |
| 22 |
d1 = t1 + t3;\ |
| 23 |
d3 = t1 - t3;\ |
| 24 |
} |
| 25 |
|
| 26 |
int |
| 27 |
foo ( uint8_t *pix1, int i_pix1, uint8_t *pix2, int i_pix2 ) |
| 28 |
{ |
| 29 |
uint32_t tmp[4][4]; |
| 30 |
uint32_t a0, a1, a2, a3; |
| 31 |
int sum = 0; |
| 32 |
for( int i = 0; i < 4; i++, pix1 += i_pix1, pix2 += i_pix2 ) |
| 33 |
{ |
| 34 |
a0 = (pix1[0] - pix2[0]) + ((pix1[4] - pix2[4]) << 16); |
| 35 |
a1 = (pix1[1] - pix2[1]) + ((pix1[5] - pix2[5]) << 16); |
| 36 |
a2 = (pix1[2] - pix2[2]) + ((pix1[6] - pix2[6]) << 16); |
| 37 |
a3 = (pix1[3] - pix2[3]) + ((pix1[7] - pix2[7]) << 16); |
| 38 |
HADAMARD4( tmp[i][0], tmp[i][1], tmp[i][2], tmp[i][3], a0,a1,a2,a3 ); |
| 39 |
} |
| 40 |
for( int i = 0; i < 4; i++ ) |
| 41 |
{ |
| 42 |
HADAMARD4( a0, a1, a2, a3, tmp[0][i], tmp[1][i], tmp[2][i], tmp[3][i] ); |
| 43 |
sum += abs2(a0) + abs2(a1) + abs2(a2) + abs2(a3); |
| 44 |
} |
| 45 |
return (((uint16_t)sum) + ((uint32_t)sum>>16)) >> 1; |
| 46 |
} |
| 47 |
|
| 48 |
/* All loops should be vectorized. */ |
| 49 |
/* { dg-final { scan-tree-dump-times "MEM\[^\n\]*tmp\[^\n\]*= " 0 "slp1" } } */ |