1  /* { dg-require-effective-target vect_uintfloat_cvt } */
       2  /* { dg-require-effective-target vect_float } */
       3  
       4  #include <stdarg.h>
       5  #include "tree-vect.h"
       6  
       7  #define N 64 
       8  
       9  unsigned int in[N*8] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63};
      10  
      11  int
      12  main1 ()
      13  {
      14    int i;
      15    float out2[N*8], fa[N*4];
      16  
      17    for (i = 0; i < N; i++)
      18      {
      19        out2[i*2] = (float) (in[i*2] * 2 + 11) ;
      20        out2[i*2 + 1] = (float) (in[i*2 + 1] * 3 + 7);
      21      
      22        fa[i] = (float) in[i*2+1];
      23      }
      24  
      25    /* check results:  */
      26    for (i = 0; i < N; i++)
      27      {
      28        if (out2[i*2] !=  (float) (in[i*2] * 2 + 11)
      29           || out2[i*2 + 1] != (float) (in[i*2 + 1] * 3 + 7)
      30           || fa[i] != (float) in[i*2+1])
      31          abort ();
      32      }
      33  
      34  
      35    return 0;
      36  }
      37  
      38  int main (void)
      39  {
      40    check_vect ();
      41  
      42    main1 ();
      43  
      44    return 0;
      45  }
      46  
      47  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect"  { target { vect_strided2 && vect_int_mult } } } } */
      48  /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect"  { target { ! { vect_strided2 && vect_int_mult } } } } } */
      49  /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 1 "vect"  { target { vect_strided2 && vect_int_mult } } } } */
      50  /* { dg-final { scan-tree-dump-times "vectorizing stmts using SLP" 0 "vect"  { target { ! { vect_strided2 && vect_int_mult } } } } } */
      51