old-autovect-branch/gcc/testsuite/gcc.dg/vect/vect-120.c

   1 /* { dg-require-effective-target vect_int } */
   2
   3 #include <stdarg.h>
   4 #include "tree-vect.h"
   5
   6 #define N 32
   7
   8 int main1 ()
   9 {
  10   int i;
  11   int ia[N];
  12   int ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  13   int ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  14   short sa[N];
  15   short sb[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  16   signed char ca[N];
  17   signed char cb[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45,0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45};
  18
  19   /* Multiple types with different sizes, used in independent
  20      computations. Vectorizable.  */
  21   for (i = 0; i < N; i++)
  22     {
  23       ia[i] = ib[i] + ic[i];
  24       sa[i] = sb[i] + (short)3;
  25       ca[i] = cb[i] + (signed char)5;
  26     }
  27
  28   /* check results:  */
  29   for (i = 0; i < N; i++)
  30     {
  31       if (ia[i] != ib[i] + ic[i]
  32           || sa[i] != sb[i] + 3
  33           || ca[i] != cb[i] + 5)
  34         abort ();
  35     }
  36
  37   return 0;
  38 }
  39
  40 int main (void)
  41 {
  42   check_vect ();
  43
  44   return main1 ();
  45 }
  46
  47 /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */
  48 /* { dg-final { cleanup-tree-dump "vect" } } */
  49