1  /* { dg-do run { target vect_cmdline_needed } } */
       2  /* { dg-options "-O2 -fno-tree-loop-distribute-patterns -ftree-vectorize -fdump-tree-vect-details -fvect-cost-model=dynamic" } */
       3  /* { dg-additional-options "-mno-sse" { target { i?86-*-* x86_64-*-* } } } */
       4  
       5  #include <stdlib.h>
       6  
       7  #define N 16
       8   
       9  #if __INT_MAX__ == 32767
      10  typedef char half_word;
      11  #elif __LONG_MAX__ == 2147483647
      12  typedef short half_word;
      13  #else
      14  typedef int half_word;
      15  #endif
      16  
      17  half_word cb[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
      18  
      19  int main ()
      20  {
      21    half_word ca[N];
      22    int i;
      23  
      24    for (i = 0; i < N; i++)
      25      {
      26        ca[i] = cb[i];
      27      }
      28  
      29    /* check results:  */
      30    for (i = 0; i < N; i++)
      31      {
      32        if (ca[i] != cb[i])
      33          abort ();
      34      }
      35  
      36    return 0;
      37  }
      38  
      39  /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target { ! { avr-*-* pru-*-* } } } } } */
      40  /* { dg-final { scan-tree-dump-times "Vectorizing an unaligned access" 0 "vect" { target { ! { avr-*-* pru-*-* } } } } } */