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