1/* { dg-require-effective-target vect_int } */ 2 3#include <stdarg.h> 4#include "tree-vect.h" 5 6#define N 16 7 8unsigned int out[N]; 9unsigned int in[N] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15}; 10 11__attribute__ ((noinline)) int 12main1 (unsigned int x, unsigned int y) 13{ 14 int i; 15 unsigned int *pin = &in[0]; 16 unsigned int *pout = &out[0]; 17 unsigned int a0, a1, a2, a3; 18 19 /* Non isomorphic. */ 20 a0 = *pin++ + 23; 21 a1 = *pin++ + 142; 22 a2 = *pin++ + 2; 23 a3 = *pin++ * 31; 24 25 *pout++ = a0 * x; 26 *pout++ = a1 * y; 27 *pout++ = a2 * x; 28 *pout++ = a3 * y; 29 30 /* Check results. */ 31 if (out[0] != (in[0] + 23) * x 32 || out[1] != (in[1] + 142) * y 33 || out[2] != (in[2] + 2) * x 34 || out[3] != (in[3] * 31) * y) 35 abort(); 36 37 return 0; 38} 39 40int main (void) 41{ 42 check_vect (); 43 44 main1 (2, 3); 45 46 return 0; 47} 48 49/* { dg-final { scan-tree-dump-times "basic block vectorized" 0 "slp2" } } */ 50/* { dg-final { cleanup-tree-dump "slp2" } } */ 51 52