1  /* { dg-require-effective-target vect_int_mult } */
       2  
       3  #include <stdarg.h>
       4  #include "tree-vect.h"
       5  
       6  #define N 16
       7  
       8  int ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
       9  int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
      10  int ia[N];
      11  
      12  __attribute__ ((noinline)) int
      13  main1 (void)
      14  {
      15    int i;
      16  
      17    /* This loop is vectorized on platforms that support vect_int_mult.  */
      18    for (i = 0; i < N; i++)
      19      {
      20        ia[i] = ib[i] * ic[i];
      21      }
      22  
      23    /* Check results.  */
      24    for (i = 0; i < N; i++)
      25      {
      26        if (ia[i] != ib[i] * ic[i])
      27  	abort ();
      28      }
      29  
      30    return 0;
      31  }
      32  
      33  int main (void)
      34  {
      35    check_vect ();
      36    return main1 ();
      37  }
      38  
      39  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
      40